Multiplication Algorithm Based on Collatz function

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F20%3APU136490" target="_blank" >RIV/00216305:26230/20:PU136490 - isvavai.cz</a>
Result on the web
<a href="https://www.fit.vut.cz/research/publication/12284/" target="_blank" >https://www.fit.vut.cz/research/publication/12284/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00224-020-09986-5" target="_blank" >10.1007/s00224-020-09986-5</a>

Result language
angličtina
Original language name
Multiplication Algorithm Based on Collatz function
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/LQ1602" target="_blank" >LQ1602: IT4Innovations excellence in science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)