Deciding parity games in quasipolynomial time
暂无分享,去创建一个
Cristian S. Calude | Sanjay Jain | Frank Stephan | Bakhadyr Khoussainov | Wei Li | Sanjay Jain | F. Stephan | B. Khoussainov | Wei Li
[1] Catriel Beeri,et al. On the menbership problem for functional and multivalued dependencies in relational databases , 1980, TODS.
[2] Anuj Dawar,et al. Complexity Bounds for Regular Games , 2005, MFCS.
[3] E. Allen Emerson,et al. Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[4] Krishnendu Chatterjee,et al. Hyperplane Separation Technique for Multidimensional Mean-Payoff Games , 2013, CONCUR.
[5] Nir Piterman,et al. From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).
[6] Florian Horn. Dicing on the Streett , 2007, Inf. Process. Lett..
[7] E. Allen Emerson,et al. The complexity of tree automata and logics of programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[8] Krishnendu Chatterjee,et al. Hyperplane Separation Technique for Multidimensional Mean-Payoff Games , 2012, CONCUR.
[9] Marcin Jurdzinski,et al. Small Progress Measures for Solving Parity Games , 2000, STACS.
[10] Amir Pnueli,et al. Faster Solutions of Rabin and Streett Games , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).
[11] Mihir Bellare,et al. The Complexity of Decision Versus Search , 1991, SIAM J. Comput..
[12] Jan van Leeuwen. Graph-Theoretic Concepts in Computer Science , 1991, Lecture Notes in Computer Science.
[13] Sven Schewe,et al. Solving parity games in big steps , 2007, J. Comput. Syst. Sci..
[14] Florian Horn,et al. Explicit Muller Games are PTIME , 2008, FSTTCS.
[15] Nicholas Kalouptsidis,et al. Efficient Algorithms for , 1999 .
[16] Markus Lohrey,et al. The Isomorphism Problem for omega-Automatic Trees , 2010, CSL.
[17] Peter Kulchyski. and , 2015 .
[18] The Synthesis toolbox From modal automata to controller synthesis , 2009 .
[19] Stephan Kreutzer,et al. Graph operations on parity games and polynomial-time algorithms , 2016, Theor. Comput. Sci..
[20] Sanjay Jain,et al. An ordered approach to solving parity games in quasi polynomial time and quasi linear space , 2017, SPIN.
[21] Viktor Petersson,et al. A Randomized Subexponential Algorithm for Parity Games , 2001, Nord. J. Comput..
[22] Paul Hunter,et al. Complexity Bounds for Muller Games , 2011 .
[23] Stephen A. Cook. Path systems and language recognition , 1970, STOC '70.
[24] Krishnendu Chatterjee,et al. Generalized Parity Games , 2007, FoSSaCS.
[25] Oliver Friedmann,et al. An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.
[26] Igor Walukiewicz,et al. How much memory is needed to win infinite games? , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.
[27] Krishnendu Chatterjee,et al. Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games , 2006, STACS.
[28] Maarten Marx,et al. Finite Model Theory and Its Applications , 2007, Texts in Theoretical Computer Science. An EATCS Series.
[29] Krishnendu Chatterjee,et al. The complexity of multi-mean-payoff and multi-energy games , 2012, Inf. Comput..
[30] Michael J. Dinneen,et al. Relaxed Update and Partition Network Games , 2002, Fundam. Informaticae.
[31] Lawrence S. Moss,et al. Review of "Automata theory and its applications" by Bakhadyr Khoussainov and Anil Nerode. Birkhäuser Boston, Inc. 2001.: and "Automata, logics, and infinite games" by E.Grädel, W. Thomas, and T. Wilke. Springer-Verlag. , 2004, SIGA.
[32] S. Safra,et al. On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[33] Michael J. Dinneen,et al. On Game-Theoretic Models of Networks , 2001, ISAAC.
[34] Ge Xia,et al. Strong computational lower bounds via parameterized complexity , 2006, J. Comput. Syst. Sci..
[35] Dietmar Berwanger,et al. Fixed-Point Logics and Solitaire Games , 2004, Theory of Computing Systems.
[36] Véronique Bruyère,et al. Games with lexicographically ordered $ω$-regular objectives , 2017, ArXiv.
[37] Kazuhisa Makino,et al. Parameterized Algorithms for Parity Games , 2015, MFCS.
[38] Helmut Seidl. Fast and Simple Nested Fixpoints , 1996, Inf. Process. Lett..
[39] Wolfgang Thomas,et al. On the Synthesis of Strategies in Infinite Games , 1995, STACS.
[40] Hugo Gimbert,et al. A short proof of correctness of the quasi-polynomial time algorithm for parity games , 2017, ArXiv.
[41] Marcin Jurdzinski,et al. Succinct progress measures for solving parity games , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
[42] Igor Walukiewicz,et al. Permissive strategies: from parity games to safety games , 2002, RAIRO Theor. Informatics Appl..
[43] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[44] Colin Stirling,et al. Bisimulation, Modal Logic and Model Checking Games , 1999, Logic Journal of the IGPL.
[45] Sasha Rubin,et al. Alternating traps in Muller and parity games , 2013, Theor. Comput. Sci..
[46] Henrik Björklund,et al. Memoryless determinacy of parity and mean payoff games: a simple proof , 2004, Theor. Comput. Sci..
[47] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[48] Aniello Murano,et al. Solving Parity Games Using an Automata-Based Algorithm , 2016, CIAA.
[49] Jan Obdržálek,et al. Algorithmic Analysis of Parity Games , 2006 .
[50] P. W. Hunter,et al. Complexity and infinite games on finite graphs , 2007 .
[51] Karoliina Lehtinen,et al. A modal μ perspective on solving parity games in quasi-polynomial time , 2018, LICS.
[52] Sven Schewe,et al. From Parity and Payoff Games to Linear Programming , 2009, MFCS.
[53] Hajime Ishihara,et al. Complexity of Some Infinite Games Played on Finite Graphs , 2002, WG.
[54] Michael R. Fellows,et al. Fundamentals of Parameterized Complexity , 2013 .
[55] Olivier Finkel,et al. A hierarchy of tree-automatic structures , 2011, The Journal of Symbolic Logic.
[56] Robert McNaughton,et al. Infinite Games Played on Finite Graphs , 1993, Ann. Pure Appl. Logic.
[57] Igor Walukiewicz. Pushdown Processes: Games and Model-Checking , 2001, Inf. Comput..
[58] Uri Zwick,et al. A deterministic subexponential algorithm for solving parity games , 2006, SODA '06.
[59] Krishnendu Chatterjee,et al. Quantitative stochastic parity games , 2004, SODA '04.
[60] Oliver Friedmann,et al. Solving Parity Games in Practice , 2009, ATVA.
[61] W. Zielonka. In nite games on nitely coloured graphs with applications to automata on in nite trees , 1998 .
[62] E. Emerson,et al. Tree Automata, Mu-Calculus and Determinacy (Extended Abstract) , 1991, FOCS 1991.
[63] Krishnendu Chatterjee,et al. Strategy synthesis for multi-dimensional quantitative objectives , 2012, Acta Informatica.
[64] Roman Rabinovich,et al. The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs , 2012, GandALF.
[65] Yuri Gurevich,et al. Trees, automata, and games , 1982, STOC '82.
[66] Thomas Wilke,et al. Alternating tree automata, parity games, and modal {$\mu$}-calculus , 2001 .
[67] Wieslaw Zielonka,et al. Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..
[68] Olivier Finkel,et al. The isomorphism relation between tree-automatic Structures , 2010, ArXiv.
[69] Neil Immerman,et al. Number of Quantifiers is Better Than Number of Tape Cells , 1981, J. Comput. Syst. Sci..
[70] E. Allen Emerson,et al. Automata, Tableaux and Temporal Logics (Extended Abstract) , 1985, Logic of Programs.
[71] Anil Nerode,et al. Automata theory and its applications , 2001 .
[72] Somesh Jha,et al. An Improved Algorithm for the Evaluation of Fixpoint Expressions , 1994, Theor. Comput. Sci..
[73] Jiamou Liu,et al. Efficient Algorithms for Games Played on Trees with Back-edges , 2011, Fundam. Informaticae.
[74] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[75] A. Prasad Sistla,et al. On model checking for the µ-calculus and its fragments , 2001, Theor. Comput. Sci..
[76] Henrik Björklund,et al. On Fixed-Parameter Complexity of Infinite Games , 2003 .
[77] Somesh Jha,et al. An Improved Algorithm for the Evaluation of Fixpoint Expressions , 1997, Theor. Comput. Sci..
[78] Marcin Jurdziński,et al. Deciding the Winner in Parity Games is in UP \cap co-Up , 1998, Inf. Process. Lett..
[79] Shmuel Safra,et al. Exponential Determinization for omega-Automata with a Strong Fairness Acceptance Condition , 2006, SIAM J. Comput..