The Complexity of Minimal Satisfiability Problems

Lefteris M. Kirousis, Phokion G. Kolaitis. The Complexity of Minimal Satisfiability Problems. In Afonso Ferreira, Horst Reichel, editors, STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings. Volume 2010 of Lecture Notes in Computer Science, pages 407-418, Springer, 2001. [doi]

Abstract

Abstract is missing.