Uriel Feige, Carsten Lund. On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract). In Proceedings of the Twenty Fourth Annual ACM Symposium on Theory of Computing, 4-6 May 1992, Victoria, British Columbia, Canada. pages 643-654, ACM, 1992.
@inproceedings{FeigeL92, title = {On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract)}, author = {Uriel Feige and Carsten Lund}, year = {1992}, researchr = {https://researchr.org/publication/FeigeL92}, cites = {0}, citedby = {0}, pages = {643-654}, booktitle = {Proceedings of the Twenty Fourth Annual ACM Symposium on Theory of Computing, 4-6 May 1992, Victoria, British Columbia, Canada}, publisher = {ACM}, }