On the (non) NP-hardness of computing circuit complexity (Q4601837)
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 6829285
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the (non) NP-hardness of computing circuit complexity |
scientific article; zbMATH DE number 6829285 |
Statements
24 January 2018
0 references
circuit lower bounds
0 references
minimum circuit size problem
0 references
NP-completeness
0 references
projections
0 references
reductions
0 references
0.9871452450752258
0 references
0.9094261527061462
0 references
0.8783061504364014
0 references
0.8597921133041382
0 references
