Publication Details
Multiplication Algorithm Based on Collatz function
BAŘINA, D. Multiplication Algorithm Based on Collatz function. Theory of Computing Systems, 2020, vol. 64, no. 8, p. 1331-1337. ISSN: 1433-0490.
Czech title
Algoritmus násobení založený na Collatzově funkci
Type
journal article
Language
English
Authors
Bařina David, Ing., Ph.D.
(DCGM)
Keywords
multiplication algorithm, division algorithm, computer arithmetic, Collatz conjecture
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.
Published
2020
Pages
1331–1337
Journal
Theory of Computing Systems, vol. 64, no. 8, ISSN 1433-0490
DOI
UT WoS
000533052700001
EID Scopus
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/"
}