A Super-Polynomial Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it
Oliver FriedmannPublished in: CoRR (2009)
Keyphrases
- lower bound
- optimal solution
- np hard
- objective function
- selection algorithm
- computational cost
- k means
- optimal strategy
- preprocessing
- detection algorithm
- dynamic programming
- worst case
- similarity measure
- convergence rate
- expectation maximization
- significant improvement
- search space
- optimization algorithm
- learning algorithm
- competitive ratio
- upper bound
- cost function
- matching algorithm
- search strategy
- computational complexity
- lower and upper bounds
- multi step