6 search results - page 1 / 2 » An improvement of the Moser-Tardos algorithmic local lemma |
CORR
2011
Springer
13 years 5 months ago
2011
Springer
A recent theorem of Bissacot, et al. proved using results about the cluster expansion in statistical mechanics extends the Lov´asz Local Lemma by weakening the conditions under w...
ALGORITHMICA
2010
13 years 11 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...
ECCC
2006
13 years 11 months ago
2006
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
ESA
2009
Springer
14 years 5 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...
EMNLP
2010
13 years 9 months ago
2010
We describe a model for the lexical analysis of Arabic text, using the lists of alternatives supplied by a broad-coverage morphological analyzer, SAMA, which include stable lemma ...