Absorbing random walks and the NAE2SAT problem.
K. SubramaniXiaofeng GuPublished in: Int. J. Comput. Math. (2011)
Keyphrases
- random walk
- sat problem
- satisfiability problem
- np complete
- sat solvers
- constraint satisfaction problems
- phase transition
- max sat
- markov chain
- randomly generated
- sat instances
- boolean satisfiability
- random sat instances
- propositional satisfiability
- directed graph
- decision problems
- markov random walk
- stochastic local search
- transition probabilities
- spectral methods
- davis putnam
- constraint satisfaction
- stationary distribution
- computational complexity
- weighted max sat
- cnf formula
- bayesian networks
- transition probability matrix
- random sat
- maximum satisfiability
- optimal solution
- temporal logic
- scheduling problem
- branch and bound
- branch and bound algorithm