作者
Stephen A Cook, Stål O Aanderaa
发表日期
1969/8/1
期刊
Transactions of the American Mathematical Society
卷号
142
页码范围
291-314
出版商
American Mathematical Society
简介
1. Introduction. An underlying goal of the research reported here is to develop a theory showing that the process of multiplying decimal integers is intrinsically more difficult than the process of adding them (2). In part I of this paper we present a precise conjecture which is a possible formulation of this proposition. The formulation is not completely satisfactory, but it certainly bears on the problem and raises interesting mathematical questions. Part II contains a proof of a weakened form of the conjecture.
There are several different ways in which multiplication seems to be more difficult than addition, and each could lead to a different formulation of the problem. For example, experience of computer designers indicates that it takes more circuitry to compute the fixed-point product of two n-digit integers than to find the sum. Again, even with the increased circuitry, the time required to carry out the multiplication exceeds that …
引用总数
1985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024312342133431123148212181313151712201815162421323631403314
学术搜索中的文章
SA Cook, SO Aanderaa - Transactions of the American Mathematical Society, 1969