On simplified NP-complete variants of Monotone3-Sat.
Andreas DarmannJanosch DöckerPublished in: Discret. Appl. Math. (2021)
Keyphrases
- np complete
- satisfiability problem
- sat problem
- np complete problems
- phase transition
- randomly generated
- np hard
- constraint satisfaction problems
- search procedures
- computational complexity
- boolean satisfiability
- pspace complete
- propositional satisfiability
- conjunctive queries
- sat instances
- boolean formula
- max sat
- sat solvers
- upper bound
- cnf formula
- sat solving
- term dnf
- stochastic local search
- uniform distribution
- stochastic local search algorithms
- bounded treewidth
- polynomial time complexity
- objective function
- propositional logic
- sat encodings
- search algorithm