Publication result detail

Multiplication Algorithm Based on Collatz function

BAŘINA, D.

Original Title

Multiplication Algorithm Based on Collatz function

English Title

Multiplication Algorithm Based on Collatz function

Type

WoS Article

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.

English 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

Key words in English

multiplication algorithm, division algorithm, computer arithmetic, Collatz conjecture

Authors

BAŘINA, D.

RIV year

2021

Released

15.05.2020

ISBN

1433-0490

Periodical

THEORY OF COMPUTING SYSTEMS

Volume

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="1432-4350",
  url="https://www.fit.vut.cz/research/publication/12284/"
}

Documents

postprint
Barina2020_Article_MultiplicationAlgorithmBasedOn