Kolmogorov characterizations of complexity classes (Q804291): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(91)90282-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1989364208 / rank | |||
Normal rank | |||
Revision as of 01:27, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Kolmogorov characterizations of complexity classes |
scientific article |
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
