The non-hardness of approximating circuit size (Q5919681)
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: The non-hardness of approximating circuit size |
scientific article; zbMATH DE number 7121052
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The non-hardness of approximating circuit size |
scientific article; zbMATH DE number 7121052 |
Statements
The non-hardness of approximating circuit size (English)
0 references
22 October 2019
0 references
NP-completeness
0 references
Minimum Circuit Size problem
0 references
reductions
0 references
time-bounded Kolmogorov complexity
0 references
