On the NP-Completeness of the Minimum Circuit Size Problem. (Q5275370)
From MaRDI portal
scientific article; zbMATH DE number 6744921
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the NP-Completeness of the Minimum Circuit Size Problem. |
scientific article; zbMATH DE number 6744921 |
Statements
13 July 2017
0 references
minimum circuit size
0 references
NP-completeness
0 references
truth-table reductions
0 references
circuit complexity
0 references
On the NP-Completeness of the Minimum Circuit Size Problem. (English)
0 references
