Lower bounds for random 3-SAT via differential equations.
Dimitris AchlioptasPublished in: Theor. Comput. Sci. (2001)
Keyphrases
- differential equations
- lower bound
- random sat
- max sat
- phase transition
- upper bound
- branch and bound algorithm
- sat problem
- satisfiability problem
- dynamical systems
- branch and bound
- random sat instances
- boolean satisfiability
- np hard
- numerical solution
- boundary value problem
- stochastic local search
- ordinary differential equations
- constraint satisfaction
- objective function
- partial differential equations
- optimal solution
- randomly generated
- numerical methods
- neural network
- davis putnam
- search algorithm
- sat solvers
- computational complexity
- dynamic programming