A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity (Q4301636)
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 617055
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity |
scientific article; zbMATH DE number 617055 |
Statements
A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity (English)
0 references
10 August 1994
0 references
Karp Lipton theorem
0 references
complexity classes
0 references
Kolmogorov complexity
0 references
0.7931680679321289
0 references
0.7583370804786682
0 references
0.7452505230903625
0 references
