536 search results - page 2 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
COCO
2009
Springer
14 years 10 days ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
COMBINATORICS
1999
13 years 5 months ago
1999
In this article we use two different methods to find new lower bounds for some multicolored Ramsey numbers. In the first part we use the finite field method used by Greenwood and ...
STOC
2002
ACM
14 years 6 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
SAT
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
IWANN
2009
Springer
13 years 10 months ago
2009
Springer
We propose a general method for estimating the distance between a compact subspace K of the space L1 ([0, 1]s ) of Lebesgue measurable functions defined on the hypercube [0, 1]s ,...