The 2CNF Boolean Formula Satisfiability Problem and the Linear Space Hypothesis.
Tomoyuki YamakamiPublished in: CoRR (2017)
Keyphrases
- satisfiability problem
- conjunctive normal form
- linear space
- boolean formula
- np complete
- sat problem
- sat instances
- temporal logic
- search algorithm
- phase transition
- external memory
- stochastic local search
- max sat
- sat solvers
- search space
- data structure
- database
- constraint satisfaction
- dynamic programming
- propositional satisfiability