Naohi Eguchi

15 papers B 1Journal 10Unranked 4
YearRankTypeTitle / Venue / Authors
2015 J jnl
A new order-theoretic characterisation of the polytime computable functions.
Theor. Comput. Sci.
Martin Avanzini, Naohi Eguchi, Georg Moser
2015 — conf
Formalizing Termination Proofs under Polynomial Quasi-interpretations.
FICS
Naohi Eguchi
2014 — conf
Complexity Analysis of Precedence Terminating Infinite Graph Rewrite Systems.
TERMGRAPH
Naohi Eguchi
2014 J jnl
Proving Termination of Unfolding Graph Rewriting for General Safe Recursion.
CoRR
Naohi Eguchi
2013 J jnl
A New Term Rewriting Characterisation of ETIME functions.
CoRR
Martin Avanzini, Naohi Eguchi
2013 — conf
Predicative Lexicographic Path Orders - An Application of Term Rewriting to the Region of Primitive Recursive Functions.
FOPARA
Naohi Eguchi
2013 J jnl
Predicative Lexicographic Path Orders: Towards a Maximal Model for Primitive Recursive Functions.
CoRR
Naohi Eguchi
2012 B conf
A New Order-Theoretic Characterisation of the Polytime Computable Functions.
APLAS
Martin Avanzini, Naohi Eguchi, Georg Moser
2012 J jnl
A New Order-theoretic Characterisation of the Polytime Computable Functions
CoRR
Martin Avanzini, Naohi Eguchi, Georg Moser
2012 J jnl
A term-rewriting characterization of PSPACE
CoRR
Naohi Eguchi
2011 — conf
A Path Order for Rewrite Systems that Compute Exponential Time Functions.
RTA
Martin Avanzini, Naohi Eguchi, Georg Moser
2010 J jnl
A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report)
CoRR
Martin Avanzini, Naohi Eguchi, Georg Moser
2009 J jnl
A lexicographic path order with slow growing derivation bounds.
Math. Log. Q.
Naohi Eguchi
2009 J jnl
A new function algebra of EXPTIME functions by safe nested recursion.
ACM Trans. Comput. Log.
Toshiyasu Arai, Naohi Eguchi
2006 J jnl
A new function algebra of EXPTIME functions by safe nested recursion
CoRR
Toshiyasu Arai, Naohi Eguchi