33 citations · 206 across the 29 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
cs.CC2012★ 4 cited
Polynomial Path Orders: A Maximal Model
Martin Avanzini, Georg Moser
This paper is concerned with the automated complexity analysis of term rewrite systems (TRSs for short) and the ramification of these in implicit computational complexity theory (I…
cs.PL2012★ 3 cited
A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems
Georg Moser, Michael Schaper
We revisit known transformations from Jinja bytecode to rewrite systems from the viewpoint of runtime complexity. Suitably generalising the constructions proposed in the literature…
cs.CC2012★ 12 cited
A New Order-theoretic Characterisation of the Polytime Computable Functions
Martin Avanzini, Naohi Eguchi, Georg Moser
We propose a new order, the small polynomial path order (sPOP* for short). The order sPOP* provides a characterisation of the class of polynomial time computable function via term…