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. Theoretical Computer Science, 607:282-295, 2015. [doi]

Authors

Iyad A. Kanj

This author has not been identified. Look up 'Iyad A. Kanj' in Google

Stefan Szeider

This author has not been identified. Look up 'Stefan Szeider' in Google