An exact algorithm for the Boolean connectivity problem for k-CNF

Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto. An exact algorithm for the Boolean connectivity problem for k-CNF. Theoretical Computer Science, 412(35):4613-4618, 2011. [doi]

@article{MakinoTY11-0,
  title = {An exact algorithm for the Boolean connectivity problem for k-CNF},
  author = {Kazuhisa Makino and Suguru Tamaki and Masaki Yamamoto},
  year = {2011},
  doi = {10.1016/j.tcs.2011.04.041},
  url = {http://dx.doi.org/10.1016/j.tcs.2011.04.041},
  researchr = {https://researchr.org/publication/MakinoTY11-0},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {412},
  number = {35},
  pages = {4613-4618},
}