On the hardness of computing the permanent of random matrices (Q1355377)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the hardness of computing the permanent of random matrices |
scientific article; zbMATH DE number 1013423
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the hardness of computing the permanent of random matrices |
scientific article; zbMATH DE number 1013423 |
Statements
On the hardness of computing the permanent of random matrices (English)
0 references
15 March 2001
0 references
random matrices
0 references
computational complexity
0 references
interactive proof systems
0 references
permanent
0 references
polynomial time algorithm
0 references
