General Ramified Recurrence is Sound for Polynomial Time
Logic in Computer Science
2010-05-05 v1 Computational Complexity
Abstract
Leivant's ramified recurrence is one of the earliest examples of an implicit characterization of the polytime functions as a subalgebra of the primitive recursive functions. Leivant's result, however, is originally stated and proved only for word algebras, i.e. free algebras whose constructors take at most one argument. This paper presents an extension of these results to ramified functions on any free algebras, provided the underlying terms are represented as graphs rather than trees, so that sharing of identical subterms can be exploited.
Cite
@article{arxiv.1005.0521,
title = {General Ramified Recurrence is Sound for Polynomial Time},
author = {Ugo Dal Lago and Simone Martini and Margherita Zorzi},
journal= {arXiv preprint arXiv:1005.0521},
year = {2010}
}