Přístupnostní navigace
E-application
Search Search Close
Publication detail
BAŘINA, D.
Original Title
Multiplication Algorithm Based on Collatz function
Type
journal article in Web of Science
Language
English
Original Abstract
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.
Keywords
multiplication algorithm, division algorithm, computer arithmetic, Collatz conjecture
Authors
Released
15. 5. 2020
ISBN
1433-0490
Periodical
Theory of Computing Systems
Year of study
64
Number
8
State
Federal Republic of Germany
Pages from
1331
Pages to
1337
Pages count
7
URL
https://www.fit.vut.cz/research/publication/12284/
BibTex
@article{BUT163996, author="David {Bařina}", title="Multiplication Algorithm Based on Collatz function", journal="Theory of Computing Systems", year="2020", volume="64", number="8", pages="1331--1337", doi="10.1007/s00224-020-09986-5", issn="1433-0490", url="https://www.fit.vut.cz/research/publication/12284/" }