Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines

Authors:
Scott Diehl;Dieter van Melkebeek
Affiliations:
-;-
Venue:
SIAM Journal on Computing
Year:
2006

Citing 0
Cited 5

A survey of lower bounds for satisfiability and related problems

Foundations and Trends® in Theoretical Computer Science
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers

Computational Complexity
Lower Bounds for Swapping Arthur and Merlin

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Alternation-Trading Proofs, Linear Programming, and Lower Bounds

ACM Transactions on Computation Theory (TOCT)
Proving the Power of Postselection

Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

We establish the first polynomial-strength time-space lower bounds for problems in the linear-time hierarchy on randomized machines with two-sided error. We show that for any integer $\ell 1$ and constant $c