Complexity and Algorithms for Well-Structured k-SAT Instances

Konstantinos Georgiou, Periklis A. Papakonstantinou. Complexity and Algorithms for Well-Structured k-SAT Instances. In Hans Kleine Büning, Xishun Zhao, editors, Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings. Volume 4996 of Lecture Notes in Computer Science, pages 105-118, Springer, 2008. [doi]

Abstract

Abstract is missing.