Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses (Q2819595): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 19:09, 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 2016
0 references