FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2156584294> ?p ?o ?g. }

• W2156584294 endingPage "2155" @default.
• W2156584294 startingPage "2132" @default.
• W2156584294 abstract "The Lovász local lemma (LLL) [P. Erdös and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, in Infinite and Finite Sets, Vol. II, A. Hajnal, R. Rado, and V. T. Sós, eds., North--Holland, Amsterdam, 1975, pp. 609--627] is a powerful result in probability theory that informally states the following: the probability that none of a set of bad events happens is positive if the probability of each event is small compared to the number of events that depend on it. The LLL is often used for nonconstructive existence proofs of combinatorial structures. A prominent application is to $k$-CNF formulas, where the LLL implies that if every clause in a formula shares variables with at most $d leq 2^k/e-1$ other clauses, then such a formula has a satisfying assignment. Recently, a randomized algorithm to efficiently construct a satisfying assignment in this setting was given by Moser [A constructive proof of the Lovász local lemma, in STOC '09: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, ACM, New York, 2009, pp. 343--350]. Subsequently Moser and Tardos [J. ACM, 57 (2010), pp. 11:1--11:15] gave a general algorithmic framework for the LLL and a randomized algorithm within this framework to construct the structures guaranteed by the LLL. The main problem left open by Moser and Tardos was to design an efficient deterministic algorithm for constructing structures guaranteed by the LLL. In this paper we provide such an algorithm. Our algorithm works in the general framework of Moser and Tardos with a minimal loss in parameters. For the special case of constructing satisfying assignments for $k$-CNF formulas with $m$ clauses, where each clause shares variables with at most $d leq 2^{k/(1+epsilon)}/e - 1$ other clauses, for any $epsilonin (0,1)$, we give a deterministic algorithm that finds a satisfying assignment in time $tilde{O}(m^{2(1+1/epsilon)})$. This improves upon the deterministic algorithms of Moser and of Moser and Tardos with running times $m^{Omega(k^2)}$ and $m^{Omega(d log d)}$, respectively, which are superpolynomial for $k=omega(1)$ and $d=omega(1)$, and upon the previous best deterministic algorithm of Beck, which runs in polynomial time only for $dleq 2^{k/16}/4$. Our algorithm is the first deterministic algorithm that works in the general framework of Moser and Tardos. We also give a parallel NC algorithm for the same setting, improving upon an algorithm of Alon [Random Structures Algorithms, 2 (1991), pp. 367--378]." @default.
• W2156584294 created "2016-06-24" @default.
• W2156584294 creator A5011591780 @default.
• W2156584294 creator A5029531416 @default.
• W2156584294 creator A5080591933 @default.
• W2156584294 date "2013-01-01" @default.
• W2156584294 modified "2023-09-24" @default.
• W2156584294 title "Deterministic Algorithms for the Lovász Local Lemma" @default.
• W2156584294 cites W1964089073 @default.
• W2156584294 cites W1967680338 @default.
• W2156584294 cites W1982618872 @default.
• W2156584294 cites W1992843513 @default.
• W2156584294 cites W2000992447 @default.
• W2156584294 cites W2019807548 @default.
• W2156584294 cites W2022392080 @default.
• W2156584294 cites W2072870176 @default.
• W2156584294 cites W2084427019 @default.
• W2156584294 cites W2100061495 @default.
• W2156584294 cites W2109693504 @default.
• W2156584294 cites W2128452148 @default.
• W2156584294 doi "https://doi.org/10.1137/100799642" @default.
• W2156584294 hasPublicationYear "2013" @default.
• W2156584294 type Work @default.
• W2156584294 sameAs 2156584294 @default.
• W2156584294 citedByCount "51" @default.
• W2156584294 countsByYear W21565842942014 @default.
• W2156584294 countsByYear W21565842942015 @default.
• W2156584294 countsByYear W21565842942016 @default.
• W2156584294 countsByYear W21565842942017 @default.
• W2156584294 countsByYear W21565842942018 @default.
• W2156584294 countsByYear W21565842942019 @default.
• W2156584294 countsByYear W21565842942020 @default.
• W2156584294 countsByYear W21565842942021 @default.
• W2156584294 countsByYear W21565842942022 @default.
• W2156584294 countsByYear W21565842942023 @default.
• W2156584294 crossrefType "journal-article" @default.
• W2156584294 hasAuthorship W2156584294A5011591780 @default.
• W2156584294 hasAuthorship W2156584294A5029531416 @default.
• W2156584294 hasAuthorship W2156584294A5080591933 @default.
• W2156584294 hasBestOaLocation W21565842942 @default.
• W2156584294 hasConcept C108710211 @default.
• W2156584294 hasConcept C111919701 @default.
• W2156584294 hasConcept C11413529 @default.
• W2156584294 hasConcept C114614502 @default.
• W2156584294 hasConcept C118615104 @default.
• W2156584294 hasConcept C121332964 @default.
• W2156584294 hasConcept C128669082 @default.
• W2156584294 hasConcept C13533509 @default.
• W2156584294 hasConcept C177264268 @default.
• W2156584294 hasConcept C18903297 @default.
• W2156584294 hasConcept C199360897 @default.
• W2156584294 hasConcept C202854965 @default.
• W2156584294 hasConcept C2524010 @default.
• W2156584294 hasConcept C2777759810 @default.
• W2156584294 hasConcept C2778701210 @default.
• W2156584294 hasConcept C2779662365 @default.
• W2156584294 hasConcept C33923547 @default.
• W2156584294 hasConcept C41008148 @default.
• W2156584294 hasConcept C46757340 @default.
• W2156584294 hasConcept C62520636 @default.
• W2156584294 hasConcept C86803240 @default.
• W2156584294 hasConcept C98045186 @default.
• W2156584294 hasConceptScore W2156584294C108710211 @default.
• W2156584294 hasConceptScore W2156584294C111919701 @default.
• W2156584294 hasConceptScore W2156584294C11413529 @default.
• W2156584294 hasConceptScore W2156584294C114614502 @default.
• W2156584294 hasConceptScore W2156584294C118615104 @default.
• W2156584294 hasConceptScore W2156584294C121332964 @default.
• W2156584294 hasConceptScore W2156584294C128669082 @default.
• W2156584294 hasConceptScore W2156584294C13533509 @default.
• W2156584294 hasConceptScore W2156584294C177264268 @default.
• W2156584294 hasConceptScore W2156584294C18903297 @default.
• W2156584294 hasConceptScore W2156584294C199360897 @default.
• W2156584294 hasConceptScore W2156584294C202854965 @default.
• W2156584294 hasConceptScore W2156584294C2524010 @default.
• W2156584294 hasConceptScore W2156584294C2777759810 @default.
• W2156584294 hasConceptScore W2156584294C2778701210 @default.
• W2156584294 hasConceptScore W2156584294C2779662365 @default.
• W2156584294 hasConceptScore W2156584294C33923547 @default.
• W2156584294 hasConceptScore W2156584294C41008148 @default.
• W2156584294 hasConceptScore W2156584294C46757340 @default.
• W2156584294 hasConceptScore W2156584294C62520636 @default.
• W2156584294 hasConceptScore W2156584294C86803240 @default.
• W2156584294 hasConceptScore W2156584294C98045186 @default.
• W2156584294 hasIssue "6" @default.
• W2156584294 hasLocation W21565842941 @default.
• W2156584294 hasLocation W21565842942 @default.
• W2156584294 hasLocation W21565842943 @default.
• W2156584294 hasLocation W21565842944 @default.
• W2156584294 hasOpenAccess W2156584294 @default.
• W2156584294 hasPrimaryLocation W21565842941 @default.
• W2156584294 hasRelatedWork W1556405916 @default.
• W2156584294 hasRelatedWork W2005971232 @default.
• W2156584294 hasRelatedWork W201195458 @default.
• W2156584294 hasRelatedWork W2063422058 @default.
• W2156584294 hasRelatedWork W2201549953 @default.
• W2156584294 hasRelatedWork W2809765085 @default.
• W2156584294 hasRelatedWork W2949665548 @default.

• next