Multiplication is the easiest nontrivial arithmetic function (Q1066671): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(85)90051-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2003165068 / rank | |||
Normal rank | |||
Revision as of 02:27, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multiplication is the easiest nontrivial arithmetic function |
scientific article |
Statements
Multiplication is the easiest nontrivial arithmetic function (English)
0 references
1985
0 references
It is shown that fixed point multiplication can be reduced to the evaluation of any member of a very large class of functions including most of the nontrivial functions used in practice. That means that whenever any such function can be evaluated by a Boolean circuit of size S(n), multplication can be done with O(S(n)) Boolean operations, as well.
0 references
integer multiplication
0 references
fixed point multiplication
0 references
Boolean circuit
0 references
Boolean operations
0 references
