A new algorithm for mean-payoff games merges small progress measures and quasi dominions to achieve orders-of-magnitude practical speedups while preserving worst-case complexity.
Self-Witnessing Polynomia l-Time Complexity and Prime Factorization
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Solving Mean-Payoff Games via Quasi Dominions
A new algorithm for mean-payoff games merges small progress measures and quasi dominions to achieve orders-of-magnitude practical speedups while preserving worst-case complexity.