The complexity of counting locally maximal satisfying assignments of Boolean CSPs

Leslie Ann Goldberg, Mark Jerrum. The complexity of counting locally maximal satisfying assignments of Boolean CSPs. Theoretical Computer Science, 634:35-46, 2016. [doi]

@article{GoldbergJ16,
  title = {The complexity of counting locally maximal satisfying assignments of Boolean CSPs},
  author = {Leslie Ann Goldberg and Mark Jerrum},
  year = {2016},
  doi = {10.1016/j.tcs.2016.04.008},
  url = {http://dx.doi.org/10.1016/j.tcs.2016.04.008},
  researchr = {https://researchr.org/publication/GoldbergJ16},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {634},
  pages = {35-46},
}