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.
No references recorded for this publication.
No citations of this publication recorded.