Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy (Q3990656): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2165676867 / rank | |||
Normal rank | |||
Latest revision as of 21:36, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy |
scientific article |
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
