✦ LIBER ✦

The complexity of satisfiability problems: Refining Schaefer's theorem

✍ Scribed by Eric Allender; Michael Bauland; Neil Immerman; Henning Schnoor; Heribert Vollmer

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of minimal satisfiability

✍ Lefteris M. Kirousis; Phokion G. Kolaitis 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 214 KB

Complexity of Generalized Satisfiability

✍ Nadia Creignou; Miki Hermann 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 698 KB

Refinements of Milnor's fibration theore

✍ J.L. Cisneros-Molina; J. Seade; J. Snoussi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 315 KB

Statistical physics analysis of the comp

✍ S. Cocco; R. Monasson 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 528 KB

The complexity of Tarski’s fixed point t

✍ Ching-Lueh Chang; Yuh-Dauh Lyuu; Yen-Wu Ti 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 408 KB

The complexity of Euler’s integer partit

✍ Calude, Cristian S.; Calude, Elena; Queen, Melissa S. 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 242 KB