Solving 3CNF-SAT and HPP in Linear Time Using WWW.
Florin ManeaCarlos Martín-VideVictor MitranaPublished in: MCU (2004)
Keyphrases
- sat solving
- sat instances
- sat solvers
- stochastic local search
- sat encodings
- sat problem
- boolean formula
- np complete problems
- propositional satisfiability
- boolean optimization
- boolean satisfiability
- website
- conjunctive normal form
- satisfiability problem
- randomly generated
- phase transition
- solving hard
- graph coloring
- np complete
- worst case
- search algorithm
- max sat
- model counting
- world wide web
- clause learning
- propositional formulas
- propositional logic
- variable ordering
- boolean functions
- constraint satisfaction
- pseudo boolean
- weighted max sat
- random sat instances