The complexity of counting solutions to Generalised Satisfiability Problems modulo k
John D. FabenPublished in: CoRR (2008)
Keyphrases
- satisfiability problem
- pspace complete
- stochastic local search algorithms
- np complete
- temporal logic
- search algorithm
- phase transition
- graph coloring problems
- search procedures
- sat problem
- solving hard
- stochastic local search
- davis putnam
- random sat
- computational complexity
- mazurkiewicz traces
- max sat
- optimal solution
- sat instances
- finite domain
- evolutionary algorithm