Sciweavers

COCO
1992
Springer
114views Algorithms» more  COCO 1992»
14 years 3 months ago
The Power of the Middle Bit
Frederic Green, Johannes Köbler, Jacobo Tor&a...
COCO
1992
Springer
96views Algorithms» more  COCO 1992»
14 years 3 months ago
Fixed-Parameter Intractability
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
COCO
1992
Springer
92views Algorithms» more  COCO 1992»
14 years 3 months ago
Interactive Proof Systems with Polynomially Bounded Strategies
Anne Condon, Richard E. Ladner
COCO
1992
Springer
96views Algorithms» more  COCO 1992»
14 years 3 months ago
On Languages with Very High Information Content
Ronald V. Book, Jack H. Lutz
COCO
1992
Springer
82views Algorithms» more  COCO 1992»
14 years 3 months ago
Functional Characterizations of Uniform Log-depth and Polylog-depth Circuit Families
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
COCO
1992
Springer
90views Algorithms» more  COCO 1992»
14 years 3 months ago
Universal Relations
Manindra Agrawal, Somenath Biswas