On Sharing, Memoization, and Polynomial Time

Martin Avanzini 1, 2, 3 Ugo Dal Lago 2, 3
2 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : We study how the adoption of an evaluation mechanism with sharing and memoization impacts the class of functions which can be computed in polynomial time. We first show how a natural cost model in which lookup for an already computed result has no cost is indeed invariant. As a corollary, we then prove that the most general notion of ramified recurrence is sound for polynomial time, this way settling an open problem in implicit computational complexity.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01231816
Contributor : Ugo Dal Lago <>
Submitted on : Thursday, December 3, 2015 - 10:14:42 AM
Last modification on : Tuesday, April 16, 2019 - 3:08:03 PM
Long-term archiving on : Friday, April 28, 2017 - 6:46:28 PM

File

4.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Martin Avanzini, Ugo Dal Lago. On Sharing, Memoization, and Polynomial Time. Proceedings of STACS 2015, 2015, Munich, Germany. ⟨10.4230/LIPIcs.STACS.2015.62⟩. ⟨hal-01231816⟩

Share

Metrics

Record views

436

Files downloads

188