two-sided error | Sciweavers

ECCC
2008

107views more ECCC 2008»

A Quantum Time-Space Lower Bound for the Counting Hierarchy

13 years 11 months ago

We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are compl...

Dieter van Melkebeek, Thomas Watson

claim paper

Read More »

click to vote

ICALP
2005
Springer

105views Programming Languages» more ICALP 2005»

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

14 years 5 months ago

Download pages.cs.wisc.edu

We establish the ﬁrst polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...

Scott Diehl, Dieter van Melkebeek

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers