Feasible Arithmetic Computations: Valiant's Hypothesis

An account of Valiant's theory of p-computable versus p-definable polynomials, an arithmetic analogue of the Boolean theory of P versus NP, is presented, with detailed proofs of Valiant's central results.

[1]  Marek Karpinski,et al.  Foundations of Computation Theory , 1983 .

[2]  Laurent Hyafil.  On the Parallel Evaluation of Multivariate Polynomials , 1979, SIAM J. Comput..

[3]  Joachim von zur Gathen.  Permanent and determinant , 1987 .

[4]  Joachim von zur Gathen,et al.  Irreducibility of Multivariate Polynomials , 1985, J. Comput. Syst. Sci..

[5]  Hermann Jung.  On Probabilistic Time and Space , 1985, ICALP.

[6]  Gary L. Miller,et al.  Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits , 1988, SIAM J. Comput..

[7]  David A. Plaisted,et al.  New NP-hard and NP-complete polynomial and integer divisibility problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[8]  John E. Savage,et al.  The Complexity of Computing , 1976 .

[9]  Leslie G. Valiant,et al.  A complexity theory based on Boolean algebra , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[10]  Stuart J. Berkowitz,et al.  On Computing the Determinant in Small Parallel Time Using a Small Number of Processors , 1984, Inf. Process. Lett..

[11]  Wayne Eberly,et al.  Very Fast Parallel Matrix and Polynomial Arithmetic , 1984, FOCS.

[12]  B. F. Caviness,et al.  A note on the complexity of algebraic differentiation , 1977, SIGS.

[13]  L. Csanky,et al.  Fast parallel matrix inversion algorithms , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[14]  Joos Heintz,et al.  Lower Bounds for Polynomials with Algebraic Coefficients , 1980, Theor. Comput. Sci..

[15]  Joachim von zur Gathen,et al.  Parallel Arithmetic Computations: A Survey , 1986, MFCS.

[16]  Volker Strassen,et al.  Polynomials with Rational Coefficients Which are Hard to Compute , 1974, SIAM J. Comput..

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

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

[19]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[20]  Erich Kaltofen,et al.  Uniform closure properties of P-computable functions , 1986, STOC '86.

[21]  Richard P. Brent,et al.  The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.

[22]  Erich Kaltofen,et al.  A system for manipulating polynomials given by straight-line programs , 1986, SYMSAC '86.

[23]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[24]  Leslie G. Valiant,et al.  Completeness classes in algebra , 1979, STOC.

[25]  M. Marcus,et al.  On the relation between the determinant and the permanent , 1961 .

[26]  K. Kalorkoti,et al.  A Lower Bound for the Formula Size of Rational Functions , 1982, SIAM J. Comput..

[27]  J. J. Seidel,et al.  AN INTRODUCTION TO MULTILINEAR ALGEBRA AND SOME APPLICATIONS , 1984 .

[28]  David E. Penney,et al.  Perspectives in mathematics , 1972 .

[29]  Erich Kaltofen,et al.  Factoring Sparse Multivariate Polynomials , 1983, J. Comput. Syst. Sci..

[30]  H. T. Kung.  New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences , 1976, JACM.

[31]  Alexander L. Chistov,et al.  Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic , 1985, FCT.

[32]  Walter Baur,et al.  The Complexity of Partial Derivatives , 1983, Theor. Comput. Sci..

[33]  Allan Borodin,et al.  Fast parallel matrix and GCD computations , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[34]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[35]  Leslie G. Valiant,et al.  Fast Parallel Computation of Polynomials Using Few Processors , 1983, SIAM J. Comput..

[36]  John H. Reif.  Logarithmic Depth Circuits for Algebraic Functions , 1986, SIAM J. Comput..

[37]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[38]  Allan Borodin,et al.  The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.

[39]  J. H. van Lint,et al.  The van der waerden conjecture: two proofs in one year , 1982 .

[40]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.