On the (non) \(\mathsf{NP}\)-hardness of computing circuit complexity (Q5368903)
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: On the (non) NP-hardness of computing circuit complexity |
scientific article; zbMATH DE number 6789572
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the (non) \(\mathsf{NP}\)-hardness of computing circuit complexity |
scientific article; zbMATH DE number 6789572 |
Statements
11 October 2017
0 references
circuit lower bounds
0 references
reductions
0 references
NP-completeness
0 references
projections
0 references
minimum circuit size problem
0 references
0.9871452450752258
0 references
0.9049761891365052
0 references
0.8833792209625244
0 references
0.8672471046447754
0 references
0.8611795902252197
0 references
