Naohi Eguchi

发表

Formalizing Termination Proofs under Polynomial Quasi-interpretations

Naohi Eguchi, 2015, FICS.

A New Order-Theoretic Characterisation of the Polytime Computable Functions

Georg Moser, Martin Avanzini, Naohi Eguchi, 2012, APLAS.

Complexity Analysis of Precedence Terminating Infinite Graph Rewrite Systems

Naohi Eguchi, 2014, TERMGRAPH.

Term-rewriting Approaches to Implicit Computational Complexity

Naohi Eguchi, 2011 .

A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report) pdf

Georg Moser, Martin Avanzini, Naohi Eguchi, 2010, RTA.

A term-rewriting characterization of PSPACE pdf

Naohi Eguchi, 2012, ArXiv.

A new order-theoretic characterisation of the polytime computable functions☆

Georg Moser, Martin Avanzini, Naohi Eguchi, 2012, APLAS.

A New Term Rewriting Characterisation of ETIME functions pdf

Martin Avanzini, Naohi Eguchi, Martin Avanzini, 2013, ArXiv.

Predicative Lexicographic Path Orders: Towards a Maximal Model for Primitive Recursive Functions pdf

Naohi Eguchi, 2013, ArXiv.

Predicative Lexicographic Path Orders - An Application of Term Rewriting to the Region of Primitive Recursive Functions

Naohi Eguchi, 2013, FOPARA.

A lexicographic path order with slow growing derivation bounds

Naohi Eguchi, 2009, Math. Log. Q..

A new function algebra of EXPTIME functions by safe nested recursion

Toshiyasu Arai, Naohi Eguchi, T. Arai, 2006, TOCL.

Order-theoretic Approaches to Computational Complexity { Towards more natural characterisations

Naohi Eguchi, 2012 .

Proving Termination of Unfolding Graph Rewriting for General Safe Recursion pdf

Naohi Eguchi, 2014, ArXiv.

On a Correspondence between Predicative Recursion and Register Machines ∗

Georg Moser, Martin Avanzini, Naohi Eguchi, 2013 .