5 search results - page 1 / 1 » The Local Lemma Is Tight for SAT |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
ESA
2009
Springer
13 years 12 months ago
2009
Springer
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
CSR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
ALGORITHMICA
2010
13 years 5 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
CONSTRAINTS
2008
13 years 5 months ago
2008
Abstract. A very challenging problem in the genetics domain is to infer haplotypes from genotypes. This process is expected to identify genes affecting health, disease and response...