Kolmogorov characterizations of complexity classes (Q804291)
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: Kolmogorov characterizations of complexity classes |
scientific article; zbMATH DE number 4201620
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Kolmogorov characterizations of complexity classes |
scientific article; zbMATH DE number 4201620 |
Statements
Kolmogorov characterizations of complexity classes (English)
0 references
1991
0 references
The paper uses the notion of (resource-bounded) Kolmogorov-complexity to characterize the classes \(\Theta_ k^ p=P(\Sigma_ k^ p)\)- with logarithmically many queries to the oracle. The notion of pronouncements (query answer) of an oracle machine is introduced. Its Kolmogorov complexity determines whether classes of the polynomial-time hierarchy collapse.
0 references
polynomial hierarchy
0 references
Kolmogorov complexity
0 references
