The non-hardness of approximating circuit size (Q5919681): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:28, 2 February 2024
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
