Detail publikace

Multiplication Algorithm Based on Collatz function

Originální název

Multiplication Algorithm Based on Collatz function

Anglický název

Multiplication Algorithm Based on Collatz function

Jazyk

en

Originální abstrakt

This article presents a new multiplication algorithm based on the Collatz function. Assuming the validity of the Collatz conjecture, the time complexity of multiplying two n-digit numbers is O(kn), where the k is the number of odd steps in the Collatz trajectory of the first multiplicand. Most likely, the algorithm is only of theoretical interest.

Anglický abstrakt

This article presents a new multiplication algorithm based on the Collatz function. Assuming the validity of the Collatz conjecture, the time complexity of multiplying two n-digit numbers is O(kn), where the k is the number of odd steps in the Collatz trajectory of the first multiplicand. Most likely, the algorithm is only of theoretical interest.

Dokumenty

BibTex


@article{BUT163996,
  author="David {Bařina}",
  title="Multiplication Algorithm Based on Collatz function",
  annote="This article presents a new multiplication algorithm based on the Collatz
function. Assuming the validity of the Collatz conjecture, the time complexity of
multiplying two n-digit numbers is O(kn), where the k is the number of odd steps
in the Collatz trajectory of the first multiplicand. Most likely, the algorithm
is only of theoretical interest.",
  address="NEUVEDEN",
  chapter="163996",
  doi="10.1007/s00224-020-09986-5",
  edition="NEUVEDEN",
  howpublished="online",
  institution="NEUVEDEN",
  volume="NEUVEDEN",
  year="2020",
  month="may",
  pages="0--0",
  publisher="NEUVEDEN",
  type="journal article - other"
}