Sciweavers

COCO
1997
Springer
77views Algorithms» more  COCO 1997»
13 years 10 months ago
Constraint Satisfaction: The Approximability of Minimization Problems
Sanjeev Khanna, Madhu Sudan, Luca Trevisan
COCO
1997
Springer
144views Algorithms» more  COCO 1997»
13 years 11 months ago
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
Kenneth W. Regan
COCO
1997
Springer
92views Algorithms» more  COCO 1997»
13 years 11 months ago
Time Bounded Frequency Computations
Maren Hinrichs, Gerd Wechsung
COCO
1997
Springer
81views Algorithms» more  COCO 1997»
13 years 11 months ago
Complexity and Expressive Power of Logic Programming
Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andre...
COCO
1997
Springer
84views Algorithms» more  COCO 1997»
13 years 11 months ago
Hyper-Polynomial Hierarchies and the NP-Jump
Stephen A. Fenner, Steven Homer, Randall Pruim, Ma...
COCO
1997
Springer
127views Algorithms» more  COCO 1997»
13 years 11 months ago
A Nonadaptive NC Checker for Permutation Group Intersection
In this paper we design a nonadaptive NC checker for permutation group intersection, sharpening a result from Blum and Kannan 3]. This is a consequence of two results. First we sh...
Vikraman Arvind, Jacobo Torán
COCO
1997
Springer
90views Algorithms» more  COCO 1997»
13 years 11 months ago
Circuits Over PP and PL
Richard Beigel, Bin Fu