论文信息 - Testing Permanent Oracles - Revisited

Testing Permanent Oracles - Revisited

Suppose we are given an oracle that claims to approximate the permanent for most matrices X, where X is chosen from the Gaussian ensemble (the matrix entries are i.i.d. univariate complex Gaussians). Can we test that the oracle satisfies this claim? This paper gives a polynomial-time algorithm for the task.

Sanjeev Arora | Sushant Sachdeva | Arnab Bhattacharyya | Rajsekar Manokaran

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

[2] LundCarsten,et al. Algebraic methods for interactive proof systems , 1992 .

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

[4] Sanjeev Arora,et al. Fitting algebraic curves to noisy data , 2002, Symposium on the Theory of Computing.

[5] Scott Aaronson,et al. The computational complexity of linear optics , 2010, STOC '11.

[6] Andrei Z. Broder,et al. How hard is it to marry at random? (On the approximation of the permanent) , 1986, STOC '86.

[7] Jin-Yi Cai,et al. On the Hardness of Permanent , 1999, STACS.

[8] Peter W. Shor,et al. Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[9] Eric Vigoda,et al. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.

[10] Mark Jerrum,et al. Approximating the Permanent , 1989, SIAM J. Comput..

[11] Carsten Lund,et al. Algebraic methods for interactive proof systems , 1992, JACM.

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

[13] Sanjeev Arora,et al. Fitting algebraic curves to noisy data , 2002, STOC '02.