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

      A taxonomy of problems with fast parallel algorithms

      Information and Control
      Elsevier BV

      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.

          Abstract

          Related collections

          Most cited references25

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

          Fast Probabilistic Algorithms for Verification of Polynomial Identities

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

            Alternation

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

              Computational Complexity of Probabilistic Turing Machines

              John Gill (1977)
                Bookmark

                Author and article information

                Journal
                Information and Control
                Information and Control
                Elsevier BV
                00199958
                January 1985
                January 1985
                : 64
                : 1-3
                : 2-22
                Article
                10.1016/S0019-9958(85)80041-3
                bacd0be1-6ec8-4708-be1c-1a1566107bfa
                © 1985

                http://www.elsevier.com/tdm/userlicense/1.0/

                History

                Comments

                Comment on this article