On the hardness of computing the permanent of random matrices (Q1355377): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:18, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the hardness of computing the permanent of random matrices |
scientific article |
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
