An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it.
Oliver FriedmannPublished in: LICS (2009)
Keyphrases
- lower bound
- optimal solution
- np hard
- worst case
- dynamic programming
- significant improvement
- learning algorithm
- search strategy
- preprocessing
- matching algorithm
- linear complexity
- objective function
- computational cost
- selection algorithm
- detection algorithm
- upper bound
- search space
- competitive ratio
- times faster
- linear programming
- similarity measure
- cost function
- average case
- lower and upper bounds
- memory efficient
- optimization algorithm
- recognition algorithm
- neural network
- monte carlo
- theoretical analysis
- expectation maximization
- probabilistic model
- computational complexity
- k means