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

      A complexity tradeoff in ranking-function termination proofs

      Acta Informatica

      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

          Author and article information

          Journal
          10.1007/s00236-008-0085-0

          Theoretical computer science,Computer science
          Theoretical computer science, Computer science

          Comments

          Comment on this article