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 the normal view instead:
scientific article; zbMATH DE number 6631113
| 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 6631113 |
Statements
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses (English)
0 references
29 September 2016
0 references
0.9581183791160583
0 references
0.9581183791160583
0 references
0.823934018611908
0 references
0.8109229207038879
0 references
