Valiant’s Model: From Exponential Sums to Exponential Products
We study the power of big products for computing multivariate polynomials in a Valiant-like framework. More precisely, we define a new class VΠP0 as the set of families of polynomials that are exponential products of easily computable polynomials. We investigate the consequences of the hypothesis that these big products are themselves easily computable. For instance, this hypothesis would imply that the nonuniform versions of P and NP coincide. Our main result relates this hypothesis to Blum, Shub and Smale’s algebraic version of P versus NP. Let K be a field of characteristic 0. Roughly speaking, we show that in order to separate P K from NP K using a problem from a fairly large class of “simple” problems, one should first be able to show that exponential products are not easily computable. The class of “simple” problems under consideration is the class of NP problems in the structure (K,+,–,=), in which multiplication is not allowed.
KeywordsTuring Machine Arithmetic Circuit Polynomial Size Boolean Circuit Polynomial Size Circuit
Unable to display preview. Download preview PDF.
- 1.Adleman, L.M.: Two theorems on random polynomial time. In: Proceedings of the 19th IEEE symposium on foundations of computer science, October 1978, pp. 75–83 (1978)Google Scholar
- 2.Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, Heidelberg (1998)Google Scholar
- 5.Fournier, H., Koiran, P.: Are lower bounds easier over the reals? In: Proc. 30th ACM Symposium on Theory of Computing, pp. 507–513 (1998)Google Scholar
- 11.Lipton, R.J.: Straight-line complexity and integer factorization. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol. 877, pp. 71–79. Springer, Heidelberg (1994)Google Scholar
- 12.Malod, G.: Polynmes et coefficients. PhD thesis, Universit Claude Bernard Lyon (July 1, 2003)Google Scholar
- 14.Poizat, B.: Les petits cailloux. Aléas (1995)Google Scholar
- 17.Valiant, L.G.: Completeness classes in algebra. In: Proc. 11th ACM Symposium on Theory of Computing, pp. 249–261 (1979)Google Scholar