An Algorithm for the SAT Problem for Formulae of Linear Length

Magnus Wahlström. An Algorithm for the SAT Problem for Formulae of Linear Length. In Gerth Stølting Brodal, Stefano Leonardi, editors, Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings. Volume 3669 of Lecture Notes in Computer Science, pages 107-118, Springer, 2005. [doi]

@inproceedings{Wahlstrom05,
  title = {An Algorithm for the SAT Problem for Formulae of Linear Length},
  author = {Magnus Wahlström},
  year = {2005},
  doi = {10.1007/11561071_12},
  url = {http://dx.doi.org/10.1007/11561071_12},
  researchr = {https://researchr.org/publication/Wahlstrom05},
  cites = {0},
  citedby = {0},
  pages = {107-118},
  booktitle = {Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings},
  editor = {Gerth Stølting Brodal and Stefano Leonardi},
  volume = {3669},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-29118-0},
}