Polarised random -SAT.
Joel Larsson DanielssonKlas MarkströmPublished in: Comb. Probab. Comput. (2023)
Keyphrases
- random sat
- phase transition
- satisfiability problem
- sat problem
- random constraint satisfaction problems
- random sat instances
- max sat
- boolean satisfiability
- np complete
- davis putnam
- randomly generated
- search algorithm
- constraint satisfaction
- stochastic local search
- propositional logic
- temporal logic
- lower bound
- branch and bound algorithm
- sat instances
- graph coloring
- cellular automata
- logic programs
- search space
- genetic algorithm