On the Hardness of Permanent

We prove that if there is a polynomial time algorithm which computes the permanent of a matrix of order n for any inverse polynomial fraction of all inputs, then there is a BPP algorithm computing the permanent for every matrix. It follows that this hypothesis implies P #P = BPP. Our algorithm works over any sufficiently large finite field (polynomially larger than the inverse of the assumed success ratio), or any interval of integers of similar range. The assumed algorithm can also be a probabilistic polynomial time algorithm. Our result is essentially the best possible based on any black box assumption of permanent solvers, and is a simultaneous improvement of the results of Gemmell and Sudan [GS92], Feige and Lund [FL92] as well as Cai and Hemachandra [CH91], and Toda (see [ABG90]).

[1]  Richard J. Lipton,et al.  New Directions In Testing , 1989, Distributed Computing And Cryptography.

[2]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[3]  Seinosuke Toda.  On the computational power of PP and (+)P , 1989, 30th Annual Symposium on Foundations of Computer Science.

[4]  Carsten Lund,et al.  On the hardness of computing the permanent of random matrices , 1996, STOC '92.

[5]  Ronitt Rubinfeld,et al.  Reconstructing algebraic functions from mixed data , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[6]  Amihood Amir,et al.  Some connections between bounded query classes and nonuniform complexity , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[7]  Erich Kaltofen,et al.  Polynomial Factorization 1987-1991 , 1992, LATIN.

[8]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[9]  Madhu Sudan,et al.  Highly Resilient Correctors for Polynomials , 1992, Inf. Process. Lett..

[10]  B. Vucetic,et al.  Maximum likelihood decoding of Reed Solomon codes , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

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

[12]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[13]  Ronitt Rubinfeld,et al.  Self-testing/correcting for polynomials and for approximate functions , 1991, STOC '91.

[14]  Carsten Lund,et al.  On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract) , 1992, STOC.

[15]  ChallengesPaul ZimmermannInria Lorrainezimmermann.  Polynomial Factorization , 1996 .

[16]  Avi Wigderson,et al.  Randomness vs. time: de-randomization under a uniform assumption , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[17]  Dana Ron,et al.  Chinese remaindering with errors , 1999, STOC '99.