A subexponential lower bound for the Random Facet algorithm for Parity Games.
Oliver FriedmannThomas Dueholm HansenUri ZwickPublished in: SODA (2011)
Keyphrases
- lower bound
- optimal solution
- worst case
- objective function
- randomly generated
- branch and bound algorithm
- detection algorithm
- optimization algorithm
- np hard
- learning algorithm
- experimental evaluation
- cost function
- theoretical analysis
- segmentation algorithm
- computational complexity
- weighted majority
- upper bound
- dynamic programming
- computational cost
- similarity measure
- preprocessing
- neural network
- lower and upper bounds
- recognition algorithm
- search space
- k means
- particle swarm optimization
- simulated annealing
- bayesian networks
- monte carlo
- matching algorithm
- nash equilibrium
- clustering algorithm
- linear programming