Satisfiability of acyclic and almost acyclic CNF formulas

Ordyniak, Sebastian; Paulusma, Daniël; Szeider, Stefan

doi:10.1016/j.tcs.2012.12.039

by Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider

Reference:

Satisfiability of acyclic and almost acyclic CNF formulasSebastian Ordyniak, Daniël Paulusma, Stefan SzeiderTheoretical Computer Science, volume 481, pages 85-99, 2013.

Bibtex Entry:

@string{tcs="Theoretical Computer Science"}
@article{OrdyniakPaulusmaSzeider13,
  author       = {Sebastian Ordyniak and Dani{\"e}l Paulusma and
                  Stefan Szeider},
  title	       = {Satisfiability of acyclic and almost acyclic {CNF}
                  formulas},
  journal      = TCS,
  volume       = {481},
  year	       = {2013},
  pages	       = {85-99},
  doi          = {10.1016/j.tcs.2012.12.039},
}