论文信息 - Effect of operators on straight line complexity

Effect of operators on straight line complexity

This paper concerns lower bounds on the straight line complexity of multi-variate polynomials. We obtain a conditional result showing that certain explicit linear operators must greatly increase the complexity of some polynomials. We do so by showing that if these operators roughly preserve the complexity of all polynomials then, co-NP is in AM. We show that certain explicit operators must vastly increase the straight line complexity of certain polynomials.

Richard J. Lipton | Dan Boneh

[1] Stathis Zachos,et al. Does co-NP Have Short Interactive Proofs? , 1987, Inf. Process. Lett..

[2] Richard J. Lipton,et al. Straight-line complexity and integer factorization , 1994, ANTS.

[4] Oscar H. Ibarra,et al. Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs , 1983, JACM.

[5] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[6] J. Morgenstern,et al. How to compute fast a function and all its derivatives: a variation on the theorem of Baur-strassen , 1985, SIGA.

[7] Alexander Shen. IP = SPACE: simplified proof , 1992, JACM.

[8] Russell Impagliazzo,et al. Using the Groebner basis algorithm to find proofs of unsatisfiability , 1996, STOC '96.

[9] V. Strassen. Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten , 1973 .

[10] Dan Boneh,et al. Studies in computational number theory with applications to cryptography , 1996 .

[11] MorgensternJacques. How to compute fast a function and all its derivatives , 1985 .