Authors
SANJEEV Arora, BOAZ Barak
Publication date
2009
Journal
Computational Complexity
Publisher
Cambridge University Press Cambridge
Description
As long as a branch of science offers an abundance of problems, so long it is alive; a lack of problems foreshadows extinction or the cessation of independent development.–David Hilbert, 1900
The subject of my talk is perhaps most directly indicated by simply asking two questions: first, is it harder to multiply than to add? and second, why?… I (would like to) show that there is no algorithm for multiplication computationally as simple as that for addition, and this proves something of a stumbling block.
Total citations
2010201120122013201420152016201720182019202020212022111
Scholar articles
S Arora, B Barak - Computational Complexity, 2009