Hard 3-CNF-SAT problems are in P - A first step in proving NP=P.
Marcel RémonJohan BarthélemyPublished in: CoRR (2020)
Keyphrases
- sat problem
- np complete
- sat solvers
- sat solving
- satisfiability problem
- sat instances
- random sat
- boolean satisfiability
- truth assignment
- phase transition
- constraint satisfaction problems
- propositional satisfiability
- clause learning
- max sat
- randomly generated
- cnf formula
- computational complexity
- decision problems
- random instances
- boolean formula
- stochastic local search
- np hard
- orders of magnitude
- search space
- branch and bound
- davis putnam
- data structure
- propositional formulas
- boolean functions
- information retrieval