Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications
Abstract
Iyad A. Kanj, Stefan Szeider. Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications. Combinatorial Optimization and Applications - 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings (Zhao Zhang, Lidong Wu, Wen Xu, Ding-Zhu Du, eds.), volume 8881 of Lecture Notes in Computer Science, pages 637–651, 2014, Springer Verlag.
Type
Stefan Szeider
Head of Research Unit
Stefan Szeider is a Professor at the Algorithms and Complexity Group.