The complexity of counting locally maximal satisfying...

  • Main
  • 2016 / 4
  • The complexity of counting locally maximal satisfying...
Theoretical Computer Science 2016 / 4

The complexity of counting locally maximal satisfying assignments of Boolean CSPs

Goldberg, Leslie Ann, Jerrum, Mark
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Language:
english
Journal:
Theoretical Computer Science
DOI:
10.1016/j.tcs.2016.04.008
Date:
April, 2016
File:
PDF, 348 KB
english, 2016
Conversion to is in progress
Conversion to is failed