New insights on the (non-)hardness of circuit minimization and related problems (Q5205823)
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 7143743
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New insights on the (non-)hardness of circuit minimization and related problems |
scientific article; zbMATH DE number 7143743 |
Statements
New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems (English)
0 references
16 December 2019
0 references
computational complexity
0 references
Kolmogorov complexity
0 references
MCSP
0 references
circuit size
0 references
0.8900211453437805
0 references
0.8883750438690186
0 references
0.8549357056617737
0 references
0.853820264339447
0 references
