The time required to perform multiplication is investigated. A lower bound on the time required to perform multiplication, as well as multiplication modulo N , is derived and it is shown that these lower bounds can be approached. Then a lower bound on the amount of time required to perform the most significant part of multiplication (⌞ xy / N ⌟) is derived.
No takes yet. Share an insight, caveat, or question.
S. Winograd (1967) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: