On the hardness of computing the permanent of random matrices (1996)

by Uriel Feige, Carsten Lund
Venue:Computational Complexity