Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications

Iyad A. Kanj, Stefan Szeider. Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications. In Zhao Zhang, Lidong Wu, Wen Xu, Ding-Zhu Du, editors, Combinatorial Optimization and Applications - 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings. Volume 8881 of Lecture Notes in Computer Science, pages 637-651, Springer, 2014. [doi]

Abstract

Abstract is missing.