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

      Algorithmic Analysis of Programs with Well Quasi-ordered Domains

      , , ,
      Information and Computation
      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.

          Related collections

          Most cited references9

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

          Ordering by Divisibility in Abstract Algebras

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

            Parallel program schemata

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

              Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors

                Bookmark

                Author and article information

                Journal
                Information and Computation
                Information and Computation
                Elsevier BV
                08905401
                July 2000
                July 2000
                : 160
                : 1-2
                : 109-127
                Article
                10.1006/inco.1999.2843
                d1743dd7-c9c8-4e5c-af8e-e2348b76a457
                © 2000

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

                History

                Comments

                Comment on this article