当前位置: X-MOL 学术Theory Comput. Syst. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Multiplication Algorithm Based on Collatz Function
Theory of Computing Systems ( IF 0.6 ) Pub Date : 2020-05-15 , DOI: 10.1007/s00224-020-09986-5
David Barina

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.



中文翻译:

基于Collat​​z函数的乘法算法

本文提出了一种基于Collat​​z函数的新乘法算法。假设Collat​​z猜想的有效性,将两个n位数字相乘的时间复杂度为Ok n),其中k是第一个被乘数的Collat​​z轨迹中奇数步数。该算法很可能仅具有理论意义。

更新日期:2020-05-15
down
wechat
bug