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

      The polynomial hierarchy and a simple model for competitive analysis

      Mathematical Programming
      Springer Nature

      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 references13

          • Record: found
          • Abstract: not found
          • Conference Proceedings: not found

          The complexity of theorem-proving procedures

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

            The polynomial-time hierarchy

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

              On the Stackelberg strategy in nonzero-sum games

                Bookmark

                Author and article information

                Journal
                Mathematical Programming
                Mathematical Programming
                Springer Nature
                0025-5610
                1436-4646
                June 1985
                June 1985
                : 32
                : 2
                : 146-164
                Article
                10.1007/BF01586088
                800d3f46-5820-4210-b9a9-e74a624001ff
                © 1985
                History

                Comments

                Comment on this article