Time‐Space Lower Bounds for the Polynomial‐Time Hierarchy on Randomized Machines (Q3446808)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Time‐Space Lower Bounds for the Polynomial‐Time Hierarchy on Randomized Machines |
scientific article |
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