2 search results - page 1 / 1 » Unambiguous Computation: Boolean Hierarchies and Sparse Turi... |
CORR
1999
Springer
14 years 5 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 ...
COCO
1989
Springer
14 years 9 months ago
1989
Springer
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...