2
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games

      1 , 1 , 2
      Electronic Proceedings in Theoretical Computer Science
      Open Publishing Association

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references35

          • Record: found
          • Abstract: not found
          • Article: not found

          Infinite games on finitely coloured graphs with applications to automata on infinite trees

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Positional strategies for mean payoff games

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Deciding the winner in parity games is in UP ∩ co-UP

                Bookmark

                Author and article information

                Journal
                Electronic Proceedings in Theoretical Computer Science
                Electron. Proc. Theor. Comput. Sci.
                EPTCS
                Open Publishing Association
                2075-2180
                September 6 2017
                September 6 2017
                : 256
                : 121-135
                Affiliations
                [1 ]Università degli Studi di Napoli Federico II
                [2 ]Università degli Studi di Verona
                Article
                10.4204/EPTCS.256.9
                28aabbdd-823e-41f0-ad6d-da0ac6cce8dc
                © 2017
                History

                Comments

                Comment on this article