Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses (Q3149879): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:53, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses |
scientific article |
Statements
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses (English)
0 references
29 September 2002
0 references
derandomization
0 references
pseudorandomness
0 references
graph isomorphism
0 references
interactive proofs
0 references
Arthur-Merlin games
0 references
hardness versus randomness
0 references
universal traversal sequences
0 references
unique satisfiability
0 references
learning theory
0 references
rigid matrices
0 references
