On the Computational Complexity of Small Descriptions (Q4277541)
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 495792
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Computational Complexity of Small Descriptions |
scientific article; zbMATH DE number 495792 |
Statements
On the Computational Complexity of Small Descriptions (English)
0 references
13 November 1994
0 references
computational complexity
0 references
sparse sets
0 references
tally sets
0 references
polynomial-time reducibility
0 references
polynomial-time equivalence
0 references
Kolmogorov complexity
0 references
circuit complexity
0 references
0.97262615
0 references
0.88473123
0 references
0.88149697
0 references
0.8776495
0 references
0.87232506
0 references
