✦ LIBER ✦

[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 2005 Volume 3618 || The Complexity of Satisfiability Problems: Refining Schaefer’s Theorem

✍ Scribed by Jȩdrzejowicz, Joanna; Szepietowski, Andrzej

Book ID: 120305662
Publisher: Springer Berlin Heidelberg
Year: 2005
Weight: 216 KB
Category: Article
ISBN: 3540318674
DOI: 10.1007/11549345_8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Math

[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 2005 Volume 3618 || A BDD-Representation for the Logic of Equality and Uninterpreted Functions

✍ Jȩdrzejowicz, Joanna; Szepietowski, Andrzej 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg ⚖ 216 KB

[Lecture Notes in Computer Science] Math

[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 1992 Volume 629 || Graph layout problems

✍ Havel, Ivan M.; Koubek, Václav 📂 Article 📅 1992 🏛 Springer Berlin Heidelberg ⚖ 594 KB

[Lecture Notes in Computer Science] Math

[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 1977 Volume 53 || Graph-theoretic arguments in low-level complexity

✍ Gruska, Jozef 📂 Article 📅 1977 🏛 Springer Berlin Heidelberg ⚖ 997 KB

[Lecture Notes in Computer Science] Math

[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 1986 Volume 233 || Model and complexity of termination for distributed computations

✍ Gruska, Jozef; Rovan, Branislav; Wiedermann, Juraj 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 German ⚖ 417 KB

Edited By J. Gruska, B. Rovan, And J. Wiedermann. Papers Presented At The 12th Symposium On Mathematical Foundations Of Computer Science. Includes Bibliographies.

[Lecture Notes in Computer Science] STAC

[Lecture Notes in Computer Science] STACS 2004 Volume 2996 || The Complexity of Satisfiability Problems over Finite Lattices

✍ Diekert, Volker; Habib, Michel 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg ⚖ 212 KB

[Lecture Notes in Computer Science] Math

[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 2011 Volume 6907 || State Complexity of Operations on Input-Driven Pushdown Automata

✍ Murlak, Filip; Sankowski, Piotr 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 205 KB