10 search results - page 1 / 2 » Infinite computable version of Lovasz Local Lemma |
96
Voted
CORR
2010
Springer
15 years 5 days ago
2010
Springer
Lov
120
Voted
FOCS
1991
IEEE
15 years 6 months ago
1991
IEEE
The Lov´asz Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results with...
133
click to vote
CSR
2010
Springer
15 years 7 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). ...
121
Voted
ESA
2009
Springer
15 years 9 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...
114
Voted
ACL
2009
15 years 18 days ago
2009
This paper describes an incremental parser based on an adjoining operation. By using the operation, we can avoid the problem of infinite local ambiguity in incremental parsing. Th...