27 search results - page 1 / 6 » The Boolean Hierarchy and the Polynomial Hierarchy: a Closer... |
COCO
1990
Springer
13 years 9 months ago
1990
Springer
We show that if the Boolean hierarchy collapses to level k, then the polynomial hierarchy collapses to BH3(k), where BH3(k) is the kth level of the Boolean hierarchy over P 2 . Th...
FCT
2001
Springer
13 years 9 months ago
2001
Springer
We show that some natural refinements of the Straubing and Brzozowski hierarchies correspond (via the so called leaf-languages) step by step to similar refinements of the polynom...
CORR
1999
Springer
13 years 4 months ago
1999
Springer
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
We establish the first 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...
FSTTCS
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...