The probabilistic analysis of a greedy satisfiability algorithm.
Alexis C. KaporisLefteris M. KirousisEfthimios G. LalasPublished in: Random Struct. Algorithms (2006)
Keyphrases
- dynamic programming
- improved algorithm
- computational complexity
- preprocessing
- high accuracy
- experimental evaluation
- probabilistic model
- objective function
- times faster
- matching algorithm
- detection algorithm
- linear programming
- worst case
- search space
- search algorithm
- learning algorithm
- computational cost
- optimal solution
- cost function
- k means
- optimization algorithm
- locally optimal
- theoretical analysis
- greedy algorithm
- recognition algorithm
- phase transition
- satisfiability problem
- greedy algorithms
- context free parsing