Valiant's model and the cost of computing integers

Let (n) be the minimum number of arithmetic operations required to build the integer n N from the constants 1 and 2. A sequence xn is said to be "easy to compute" if there exists a polynomial

• Type: Journal
• Year: 2005
• Where: CC
• Authors: Pascal Koiran
• Keywords: Arithmetic Operations, CC 2005, Minimum Number, Sequence Xn, System Software