A short proof of correctness of the quasi-polynomial time algorithm for parity games.
Hugo GimbertRasmus Ibsen-JensenPublished in: CoRR (2017)
Keyphrases
- preprocessing
- learning algorithm
- times faster
- optimization algorithm
- np hard
- computational complexity
- detection algorithm
- theoretical analysis
- computational cost
- segmentation algorithm
- expectation maximization
- linear programming
- high accuracy
- worst case
- provably correct
- randomized algorithm
- experimental evaluation
- special case
- significant improvement
- k means
- optimal solution
- neural network
- probabilistic model
- search space
- recognition algorithm
- error correction
- reinforcement learning
- polynomial size
- bayesian networks
- polynomial time complexity