On the hardness of computing the permanent of random matrices

  title={On the hardness of computing the permanent of random matrices},
  author={Uriel Feige and Carsten Lund},
  journal={computational complexity},
We study the complexity of computing the permanent on random inputs. We consider matrices drawn randomly from the space of n by n matrices with integer values between 0 and p–1, for any large enough prime p. We show that any polynomial time algorithm which computes the permanent correctly on even an exponentially small fraction of these matrices, implies the collapse of the polynomial-time hierarchy to its second level. We also show that it is hard to get partial information about the value of… CONTINUE READING
Highly Cited
This paper has 61 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 39 extracted citations

Nondeterministic Direct Product Reductions and the Success Probability of SAT Solvers

2013 IEEE 54th Annual Symposium on Foundations of Computer Science • 2013

62 Citations

Citations per Year
Semantic Scholar estimates that this publication has 62 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…