2924 search results - page 44 / 585 » Lower Bounds in Distributed Computing |
STOC
2004
ACM
14 years 9 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
STOC
2002
ACM
14 years 9 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...
EOR
2006
13 years 8 months ago
2006
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We answer a problem posed in [GKM08] regarding a restricted model of small-space computation, tailored for solving the GEN problem. They define two variants of “incremental bra...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
We show that for k ≥ 3 even the Ω(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example ...