A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems

A. Czumaj, C. Scheideler, in:, 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.

Download
OA 190.08 KB
URN
Conference Paper
Author
Publishing Year
Proceedings Title
32nd ACM Symposium on Theory of Computing
Page
38-47
LibreCat-ID

Cite this

Czumaj A, Scheideler C. A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In: 32nd ACM Symposium on Theory of Computing.; 2000:38-47.
Czumaj, A., & Scheideler, C. (2000). A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In 32nd ACM Symposium on Theory of Computing (pp. 38–47).
@inbook{Czumaj_Scheideler_2000, title={A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems }, booktitle={32nd ACM Symposium on Theory of Computing}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={38–47}}
Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” In 32nd ACM Symposium on Theory of Computing, 38–47, 2000.
A. Czumaj and C. Scheideler, “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ,” in 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.
Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” 32nd ACM Symposium on Theory of Computing. N.p., 2000. 38–47. Print.
Main File(s)
File Name
190.08 KB
Access Level
OA Open Access
Last Uploaded
2018-04-12T08:37:23Z


Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar