23 citations · 74 across the 18 of their papers we have counts for
Showing 2013 · cs.LOShow all
2 papers · 2 filters
cs.LO2013
A New Term Rewriting Characterisation of ETIME functions
Martin Avanzini, Naohi Eguchi
Adopting former term rewriting characterisations of polytime and exponential-time computable functions, we introduce a new reduction order, the Path Order for ETIME (POE* for short…
cs.LO2013★ 14 cited
Polynomial Path Orders
Martin Avanzini, Georg Moser
This paper is concerned with the complexity analysis of constructor term rewrite systems and its ramification in implicit computational complexity. We introduce a path order with m…