COCO 1992 | Sciweavers

12

click to vote

COCO
1992
Springer

114views Algorithms» more COCO 1992»

The Power of the Middle Bit

13 years 9 months ago

Download vts.uni-ulm.de

Frederic Green, Johannes Köbler, Jacobo Tor&a...

claim paper

Read More »

5

click to vote

COCO
1992
Springer

96views Algorithms» more COCO 1992»

Fixed-Parameter Intractability

13 years 9 months ago

Download cs.haifa.ac.il

We give a novel characterization of W[1], the most important fixed-parameter intractability class in the W-hierarchy, using Boolean circuits that consist solely of majority gates. ...

Rodney G. Downey, Michael R. Fellows

claim paper

Read More »

4

click to vote

COCO
1992
Springer

92views Algorithms» more COCO 1992»

Interactive Proof Systems with Polynomially Bounded Strategies

13 years 9 months ago

Download www.cs.ubc.ca

Anne Condon, Richard E. Ladner

claim paper

Read More »

5

click to vote

COCO
1992
Springer

96views Algorithms» more COCO 1992»

On Languages with Very High Information Content

13 years 9 months ago

Download archives.cs.iastate.edu

Ronald V. Book, Jack H. Lutz

claim paper

Read More »

8

click to vote

COCO
1992
Springer

82views Algorithms» more COCO 1992»

Functional Characterizations of Uniform Log-depth and Polylog-depth Circuit Families

13 years 9 months ago

Download home.adelphi.edu

We characterize the classes of functions computable by uniform log-depth (NC1) and polylog-depth circuit families as closures of a set of base functions. (The former is equivalent...

Stephen A. Bloch

claim paper

Read More »

4

click to vote

COCO
1992
Springer

90views Algorithms» more COCO 1992»

Universal Relations

13 years 9 months ago

Download infolab.stanford.edu

Manindra Agrawal, Somenath Biswas

claim paper