Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy (Q3990656)
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: Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy |
scientific article; zbMATH DE number 38449
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy |
scientific article; zbMATH DE number 38449 |
Statements
Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy (English)
0 references
28 June 1992
0 references
counting complexity classes
0 references
polynomial-time hierarchy
0 references
randomized reducibility
0 references
