276 search results - page 4 / 56 » Lower bounds for the complexity of linear functionals in the... |
162
click to vote
COCO
1991
Springer
15 years 9 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
166
click to vote
COLT
2007
Springer
16 years 9 hour ago
2007
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
152
click to vote
FOCS
2008
IEEE
16 years 9 days 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 ...
156
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
169
Voted
SODA
2010
ACM
16 years 3 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...