Academic
Publications
Closing the Gap Between Runtime Complexity and Polytime Computability

Closing the Gap Between Runtime Complexity and Polytime Computability,10.4230/LIPIcs.RTA.2010.33,Martin Avanzini,Georg Moser

Closing the Gap Between Runtime Complexity and Polytime Computability   (Citations: 3)
BibTex | RIS | RefWorks Download
Conference: Rewriting Techniques and Applications - RTA , pp. 33-48, 2010
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...While termination of term rewrite systems (TRSs) is well studied, only recently first results were obtained which adapt termination techniques in order to obtain polynomial complexity bounds automatically, e.g., [2,3,4,5,7,9,15,16,19,20,21,23,27,28]...
    • ...Therefore, (innermost) runtime complexity corresponds to the usual notion of “complexity” for programs [5,4]...

    Lars Noschinskiet al. A Dependency Pair Framework for Innermost Complexity Analysis of Term ...

Sort by: