Satisfiability of acyclic and almost acyclic CNF formulas

Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider. Satisfiability of acyclic and almost acyclic CNF formulas. Theoretical Computer Science, 481:85-99, 2013. [doi]

Authors

Sebastian Ordyniak

This author has not been identified. Look up 'Sebastian Ordyniak' in Google

Daniël Paulusma

This author has not been identified. Look up 'Daniël Paulusma' in Google

Stefan Szeider

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