Detail publikace

Multiplication Algorithm Based on Collatz function

BAŘINA, D.

Originální název

Multiplication Algorithm Based on Collatz function

Typ

článek v časopise ve Web of Science, Jimp

Jazyk

angličtina

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.

Klíčová slova

multiplication algorithm, division algorithm, computer arithmetic, Collatz conjecture

Autoři

BAŘINA, D.

Vydáno

15. 5. 2020

ISSN

1433-0490

Periodikum

Theory of Computing Systems

Ročník

64

Číslo

8

Stát

Spolková republika Německo

Strany od

1331

Strany do

1337

Strany počet

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/"
}

Dokumenty

Barina2020_Article_MultiplicationAlgorithmBasedOn.pdf
postprint.pdf