Properties of the satisfiability threshold of the strictly d-regular random (3, 2s)-SAT problem.

Yongping Wang Daoyun Xu

Published in: Frontiers Comput. Sci. (2020)

Keyphrases

sat problem
satisfiability problem
randomly generated
random sat instances
phase transition
np complete
random sat

sat instances
sat solvers
sat solving
constraint satisfaction problems
max sat
stochastic local search
boolean satisfiability

propositional satisfiability
davis putnam
decision problems
search algorithm
random instances
evolutionary algorithm
truth assignment

temporal logic
branch and bound
clause learning
constraint satisfaction
weighted max sat
maximum satisfiability
dynamic programming