Kolmogorov characterizations of complexity classes (Q804291): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:06, 30 January 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
