Necessary and Sufficient Condition for Satisfiability of a Boolean Formula in CNF and its Implications on P versus NP problem.
Manoj KumarPublished in: CoRR (2021)
Keyphrases
- sufficient conditions
- boolean formula
- np complete
- conjunctive normal form
- sat solvers
- practical problems
- satisfiability problem
- boolean satisfiability
- quantified boolean formulas
- linear constraints
- np hard
- binary decision diagrams
- sat problem
- computational complexity
- cnf formula
- lyapunov function
- boolean functions
- sat instances
- constraint satisfaction problems
- optimal policy
- membership queries
- search algorithm
- constraint satisfaction
- orders of magnitude
- max sat