On The Hardness Of Computing The Permanent Of Random Matrices (1992)
by
Uriel Feige
,
Carsten Lund
| Venue: | COMPUTATIONAL COMPLEXITY |
| Citations: | 32 - 1 self |
BibTeX
@ARTICLE{Feige92onthe,
author = {Uriel Feige and Carsten Lund},
title = {On The Hardness Of Computing The Permanent Of Random Matrices},
journal = {COMPUTATIONAL COMPLEXITY},
year = {1992},
volume = {6},
pages = {643--654}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Extending a line of research initiated by Lipton, we study the complexity of computing the permanent of random n by n matrices with integer values between 0 and p - 1, for any suitably large prime p. Previous
