Time‐Space Lower Bounds for the Polynomial‐Time Hierarchy on Randomized Machines (Q3446808)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5167744
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time‐Space Lower Bounds for the Polynomial‐Time Hierarchy on Randomized Machines |
scientific article; zbMATH DE number 5167744 |
Statements
Time‐Space Lower Bounds for the Polynomial‐Time Hierarchy on Randomized Machines (English)
0 references
26 June 2007
0 references
time-space lower bounds
0 references
randomized algorithms
0 references
polynomial-time hierarchy
0 references
satisfiability
0 references
0.984196126461029
0 references
0.8355614542961121
0 references
0.8036685585975647
0 references
0.7932749390602112
0 references
0.787904679775238
0 references
