Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes (Q809600)
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: Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes |
scientific article; zbMATH DE number 4213442
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes |
scientific article; zbMATH DE number 4213442 |
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
0 references
0 references
0.7630584239959717
0 references
0.7590664029121399
0 references
0.7528907060623169
0 references
0.7326074242591858
0 references
