Sciweavers

COCO
1990
Springer
71views Algorithms» more  COCO 1990»
14 years 3 months ago
Circuits, Pebbling and Expressibility
V. Vinay, H. Venkateswaran, C. E. Veni Madhavan
COCO
1990
Springer
106views Algorithms» more  COCO 1990»
14 years 3 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
COCO
1990
Springer
84views Algorithms» more  COCO 1990»
14 years 3 months ago
Some Connections Between Bounded Query Classes and Non-Uniform Complexity
Amihood Amir, Richard Beigel, William I. Gasarch
COCO
1990
Springer
50views Algorithms» more  COCO 1990»
14 years 3 months ago
Width-Bounded Reducibility and Binary Search over Complexity Classes
d Abstract) Eric Allender Christopher Wilson Department of Computer Science Department of Computer Rutgers University and Information Science New Brunswick, NJ 08903, USA Universit...
Eric Allender, Christopher B. Wilson