COCO 1990 | Sciweavers

6

click to vote

COCO
1990
Springer

71views Algorithms» more COCO 1990»

Circuits, Pebbling and Expressibility

13 years 9 months ago

Download eprints.iisc.ernet.in

V. Vinay, H. Venkateswaran, C. E. Veni Madhavan

claim paper

Read More »

16

click to vote

COCO
1990
Springer

106views Algorithms» more COCO 1990»

The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection

13 years 9 months ago

Download www.cs.umbc.edu

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

claim paper

Read More »

10

click to vote

COCO
1990
Springer

84views Algorithms» more COCO 1990»

Some Connections Between Bounded Query Classes and Non-Uniform Complexity

13 years 9 months ago

Download www.cs.umd.edu

Amihood Amir, Richard Beigel, William I. Gasarch

claim paper

Read More »

12

click to vote

COCO
1990
Springer

50views Algorithms» more COCO 1990»

Width-Bounded Reducibility and Binary Search over Complexity Classes

13 years 9 months ago

Download www.cs.rutgers.edu

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

claim paper

Read More »

6

click to vote

COCO
1990
Springer

84views Algorithms» more COCO 1990»

E-mail and the Unexpected Power of Interaction

13 years 9 months ago

Download www.cs.princeton.edu

László Babai

claim paper