Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses (Q3149879)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1808487
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses |
scientific article; zbMATH DE number 1808487 |
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
0.9581183791160583
0 references
0.8301950097084045
0 references
0.8069128394126892
0 references
0.7935521006584167
0 references
