An Average Case Analysis of the Branching Algorithm for Solving $k$-Satisfiability Problems.
Ying Teh TsaiChuan Yi TangPublished in: CATS (1998)
Keyphrases
- average case
- worst case
- learning algorithm
- dynamic programming
- search algorithm
- satisfiability problem
- objective function
- randomly generated
- combinatorial optimization
- optimal solution
- theoretical analysis
- np hard
- computational complexity
- worst case analysis
- heuristic search
- convergence rate
- branch and bound algorithm
- search tree
- uniform distribution
- average case complexity