The non-hardness of approximating circuit size (Q5918358)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7377743
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The non-hardness of approximating circuit size |
scientific article; zbMATH DE number 7377743 |
Statements
The non-hardness of approximating circuit size (English)
0 references
3 August 2021
0 references
minimum circuit size problem
0 references
reductions
0 references
NP-completeness
0 references
time-bounded Kolmogorov complexity
0 references
0 references
0 references
0.9974714517593384
0 references
0.8883750438690186
0 references
0.8632267713546753
0 references
0.8611795902252197
0 references
