On the complexity of counting in the polynomial hierarchy (Q808260)
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: On the complexity of counting in the polynomial hierarchy |
scientific article; zbMATH DE number 4209602
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of counting in the polynomial hierarchy |
scientific article; zbMATH DE number 4209602 |
Statements
On the complexity of counting in the polynomial hierarchy (English)
0 references
1991
0 references
counting
0 references
Oracle alternating Turing machines
0 references
lower bound
0 references
