A Critique of Kumar's "Necessary and Sufficient Condition for Satisfiability of a Boolean Formula in CNF and Its Implications on P versus NP problem.".
Michael C. ChavrimootooHenry B. WellesPublished in: CoRR (2021)
Keyphrases
- sufficient conditions
- boolean formula
- np complete
- conjunctive normal form
- sat solvers
- practical problems
- boolean satisfiability
- cnf formula
- satisfiability problem
- np hard
- sat problem
- quantified boolean formulas
- linear constraints
- lyapunov function
- orders of magnitude
- computational complexity
- membership queries
- max sat
- optimal policy
- sat instances
- randomly generated
- reinforcement learning
- normal form
- constraint satisfaction problems
- search space
- optimal solution