Sciweavers

CORR
1999
Springer
65views Education» more  CORR 1999»
13 years 10 months ago
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
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 ...
Lane A. Hemaspaandra, Jörg Rothe