Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes (Q809600): 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)90185-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021218132 / rank | |||
Normal rank | |||
Revision as of 20:57, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes |
scientific article |
Statements
Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes (English)
0 references
1991
0 references
The concept of a nonuniform proof system, as a generalization of Karp/Lipton's advice classes, is introduced and studied. Many results from (nonuniform) complexity theory can thus be obtained in a unified framework. This includes certain results on probabilistic classes, lowness results, and collapsing results for the polynomial-time hierarchy.
0 references
nonuniform complexity
0 references
advice classes
0 references
lowness
0 references
