Naohi Eguchi

Available identifiers

zbMath Open eguchi.naohiMaRDI QIDQ2346987

List of research outcomes

Publication	Date of Publication	Type
Formalizing termination proofs under polynomial quasi-interpretations	2021-12-02	Paper
Complexity analysis of precedence terminating infinite graph rewrite systems	2021-12-02	Paper
Predicative lexicographic path orders. An application of term rewriting to the region of primitive recursive functions	2016-01-07	Paper
A new function algebra of EXPTIME functions by safe nested recursion	2015-09-17	Paper
A new order-theoretic characterisation of the polytime computable functions	2015-05-26	Paper
Proving Termination of Unfolding Graph Rewriting for General Safe Recursion	2014-04-24	Paper
Characterising Complexity Classes by Inductive Definitions in Bounded Arithmetic	2013-06-24	Paper
A Simplified Characterisation of Provably Computable Functions of the System ID_1 of Inductive Definitions	2012-05-13	Paper
A path order for rewrite systems that compute exponential time functions	2012-04-24	Paper
https://portal.mardi4nfdi.de/entity/Q3567845	2010-06-17	Paper
A lexicographic path order with slow growing derivation bounds	2009-04-09	Paper

Research outcomes over time

This page was built for person: Naohi Eguchi