Skip to main content

Research Repository

Advanced Search

Satisfiability of Acyclic and Almost Acyclic CNF Formulas

Ordyniak, S.; Paulusma, D.; Szeider, S.

Authors

S. Ordyniak

S. Szeider



Citation

Ordyniak, S., Paulusma, D., & Szeider, S. (2010, December). Satisfiability of Acyclic and Almost Acyclic CNF Formulas. Presented at IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), Chennai, India

Presentation Conference Type Conference Paper (published)
Conference Name IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)
Start Date Dec 15, 2010
End Date Dec 18, 2010
Publication Date Dec 14, 2010
Deposit Date Dec 21, 2014
Peer Reviewed Peer Reviewed
Volume 8
Pages 84-95
Series Title Leibniz International Proceedings in Informatics (LIPIcs)
DOI https://doi.org/10.4230/lipics.fsttcs.2010.84
Public URL https://durham-repository.worktribe.com/output/1154423
Publisher URL http://drops.dagstuhl.de/opus/volltexte/2010/2855/



You might also like



Downloadable Citations