On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem.
Ewald SpeckenmeyerPublished in: CSL (1987)
Keyphrases
- satisfiability problem
- search algorithm
- average case complexity
- average case
- np complete
- phase transition
- temporal logic
- clause learning
- sat problem
- constraint satisfaction
- stochastic local search
- lower bound
- stochastic local search algorithms
- search space
- sat instances
- max sat
- mazurkiewicz traces
- uniform distribution
- search tree
- search strategy
- constraint propagation
- constraint satisfaction problems
- weighted max sat
- worst case
- np hard