Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses (Q2819595)
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: Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses |
scientific article; zbMATH DE number 6631113
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses |
scientific article; zbMATH DE number 6631113 |
Statements
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses (English)
0 references
29 September 2016
0 references
