536 search results - page 37 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
DAGSTUHL
2008
13 years 10 months ago
2008
Abstract. We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size , using S...
COCOA
2010
Springer
13 years 6 months ago
2010
Springer
The classical and well-studied group testing problem is to find d defectives in a set of n elements by group tests, which tell us for any chosen subset whether it contains defectiv...
TIT
1998
13 years 8 months ago
1998
— The lower and upper bounds for the information capacity of two-layer feedforward neural networks with binary interconnections, integer thresholds for the hidden units, and zero...
ALT
2006
Springer
14 years 5 months ago
2006
Springer
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...