A note on width-parameterized SAT: An exact machine-model characterization

@article{Papakonstantinou2009ANO,
  title={A note on width-parameterized SAT: An exact machine-model characterization},
  author={Periklis A. Papakonstantinou},
  journal={Inf. Process. Lett.},
  year={2009},
  volume={110},
  pages={8-12}
}
We characterize the complexity of SAT instances with path-decompositions of width w(n). Although pathwidth is the most restrictive among the studied width-parameterizations of SAT, the most time-efficient algorithms known for such SAT instances run in time 2, even when the path-decomposition is given in the input. We wish to better understand the decision complexity of SAT instances of width ω(log n). We provide an exact correspondence between SATpw[w(n)], the problem of SAT instances with… CONTINUE READING