Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses (Q2819595): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/301250.301428 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1979479253 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:39, 19 March 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
