Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses (Q2819595)
From MaRDI portal
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
