Worst-case time bounds for coloring and satisfiability problems.
Tomás FederRajeev MotwaniPublished in: J. Algorithms (2002)
Keyphrases
- satisfiability problem
- worst case
- upper bound
- average case
- np complete
- lower bound
- search algorithm
- phase transition
- np hard
- error bounds
- temporal logic
- worst case bounds
- sat problem
- stochastic local search
- loss bounds
- pspace complete
- stochastic local search algorithms
- solving hard
- vc dimension
- sat instances
- mistake bound
- davis putnam
- random sat
- computational complexity
- randomly generated
- max sat
- knowledge base
- branch and bound
- finite domain
- objective function
- special case
- model checking
- branch and bound algorithm