Login / Signup
Simplifying Random Satisfiability Problem by Removing Frustrating Interactions
Abolfazl Ramezanpour
S. Moghimi-Araghi
Published in:
CoRR (2006)
Keyphrases
</>
satisfiability problem
np complete
temporal logic
search algorithm
sat problem
phase transition
randomly generated
stochastic local search algorithms
pspace complete
sat instances
solving hard
decision procedures
random sat
stochastic local search
constraint satisfaction problems
random instances