$$P\mathop{ =}\limits^{?}NP$$ (Q2826803)
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: $$P\mathop{ =}\limits^{?}NP$$ |
scientific article; zbMATH DE number 6640544
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | $$P\mathop{ =}\limits^{?}NP$$ |
scientific article; zbMATH DE number 6640544 |
Statements
$$P\mathop{ =}\limits^{?}NP$$ (English)
0 references
18 October 2016
0 references
arithmetic circuit complexity
0 references
Boolean circuits
0 references
diagonalization
0 references
geometric complexity theory
0 references
interactive proofs
0 references
NP-completeness
0 references
P versus NP
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
