Iyad A. Kanj, Stefan Szeider. Parameterized and subexponential-time complexity of satisfiability problems and applications. Theoretical Computer Science, 607:282-295, 2015. [doi]
No references recorded for this publication.
No citations of this publication recorded.