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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.