Funder
European Research Council
Deutsche Forschungsgemeinschaft
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference32 articles.
1. Akian, M., Gaubert, S., Guterman, A.: Tropical polyhedra are equivalent to mean payoff games. Int. Algebra Comput. 22(1), 125001 (2012). (43 pages)
2. Andersson, D., Miltersen, P.B.: The complexity of solving stochastic games on graphs. In Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pages 112–121 (2009)
3. Atserias, A., Maneva, E.: Mean-payoff games and propositional proofs. Inf. Comput. 209(4), 664–691 (2011). A preliminary version appeared in the Proceedings of 37th International Colloquium on Automata, Languages and Programming (ICALP), volume 6198 of Lecture Notes in Computer Science, Springer-Verlag, pages 102–113, 2010
4. Barto, L., Kozik, M.: Absorbing subalgebras, cyclic terms and the constraint satisfaction problem. Logical Methods Comput. Sci. 8/1(07), 1–26 (2012)
5. Bezem, M., Nieuwenhuis, R., Rodríguez-Carbonell, E.: The max-atom problem and its relevance. In LPAR, pages 47–61 (2008)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献