{"publication":"32nd ACM Symposium on Theory of Computing","date_updated":"2022-01-06T06:55:26Z","type":"conference","page":"38-47","file":[{"file_name":"STOC-00.pdf","file_id":"2296","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_size":190083,"creator":"florida","date_updated":"2018-04-12T08:37:23Z","date_created":"2018-04-12T08:37:23Z"}],"ddc":["040"],"language":[{"iso":"eng"}],"urn":"22111","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T08:37:23Z","title":"A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ","_id":"2211","date_created":"2018-04-05T07:02:46Z","citation":{"ama":"Czumaj A, Scheideler C. A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In: <i>32nd ACM Symposium on Theory of Computing</i>. ; 2000:38-47.","bibtex":"@inproceedings{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} }","mla":"Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” <i>32nd ACM Symposium on Theory of Computing</i>, 2000, pp. 38–47.","ieee":"A. Czumaj and C. Scheideler, “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ,” in <i>32nd ACM Symposium on Theory of Computing</i>, 2000, pp. 38–47.","short":"A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.","apa":"Czumaj, A., &#38; Scheideler, C. (2000). A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In <i>32nd ACM Symposium on Theory of Computing</i> (pp. 38–47).","chicago":"Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” In <i>32nd ACM Symposium on Theory of Computing</i>, 38–47, 2000."},"user_id":"14955","year":"2000","has_accepted_license":"1","status":"public","oa":"1","author":[{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}]}