A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)

A. Czumaj, C. Scheideler, in:, STOC, ACM, 2000, pp. 38–47.

Download
OA 190.08 KB
URN
Conference Paper
Author
Publishing Year
Proceedings Title
STOC
Page
38--47
LibreCat-ID

Cite this

Czumaj A, Scheideler C. A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In: STOC. ACM; 2000:38-47.
Czumaj, A., & Scheideler, C. (2000). A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In STOC (pp. 38–47). ACM.
@inbook{Czumaj_Scheideler_2000, title={A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)}, booktitle={STOC}, publisher={ACM}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={38–47}}
Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (extended Abstract).” In STOC, 38–47. ACM, 2000.
A. Czumaj and C. Scheideler, “A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract),” in STOC, 2000, pp. 38–47.
Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (extended Abstract).” STOC. ACM, 2000. 38–47. Print.
Main File(s)
File Name
190.08 KB
Access Level
OA Open Access
Last Uploaded
2018-04-12T08:49:23Z


Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar