Sciweavers

6 search results - page 2 / 2
» trs 2010
Sort
View
RTA
2010
Springer
13 years 8 months ago
Closing the Gap Between Runtime Complexity and Polytime Computability
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
Martin Avanzini, Georg Moser