Login / Signup
Solving #SAT Using Vertex Covers.
Naomi Nishimura
Prabhakar Ragde
Stefan Szeider
Published in:
SAT (2006)
Keyphrases
</>
np complete problems
stochastic local search
graph coloring
boolean optimization
sat solving
sat instances
sat encodings
boolean satisfiability
phase transition
search algorithm
satisfiability problem
variable ordering
random walk
neural network
undirected graph
sat solvers
genetic algorithm