Sciweavers

COCO
1991
Springer
173views Algorithms» more  COCO 1991»
13 years 8 months ago
On the Random-Self-Reducibility of Complete Sets
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
Joan Feigenbaum, Lance Fortnow
COCO
1990
Springer
106views Algorithms» more  COCO 1990»
13 years 9 months ago
The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection
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...
Richard Chang, Jim Kadin