On simplified NP-complete variants of Not-All-Equal 3-Sat and 3-Sat.
Andreas DarmannJanosch DöckerPublished in: CoRR (2019)
Keyphrases
- np complete
- satisfiability problem
- sat problem
- np complete problems
- phase transition
- boolean satisfiability
- randomly generated
- constraint satisfaction problems
- sat solvers
- sat instances
- search algorithm
- max sat
- np hard
- stochastic local search
- cnf formula
- propositional satisfiability
- stochastic local search algorithms
- computational complexity
- conjunctive queries
- search procedures
- pspace complete
- sat solving
- temporal logic
- neural network
- search strategies
- propositional formulas