Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider. Satisfiability of acyclic and almost acyclic CNF formulas. Theoretical Computer Science, 481:85-99, 2013. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider. sat 2011: 47-60 [doi] Satisfiability of Acyclic and Almost Acyclic CNF FormulasSebastian Ordyniak, Daniël Paulusma, Stefan Szeider. fsttcs 2010: 84-95 [doi]
The following publications are possibly variants of this publication: