On Sharing, Memoization, and Polynomial Time (Long Version)

2015/01/05 by Avanzini, Martin, Lago, Ugo Dal
#Computational Complexity (cs.CC) #F.1.3 #F.3.2 #F.4.1 #F.4.2 #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1501.00894

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 value 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.

Related

• General Ramified Recurrence and Polynomial-time Completeness
• Representations and evaluation strategies for feasibly approximable\n functions
• Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version)
• Strong Call-by-Value is Reasonable, Implosively
• Polynomial running times for polynomial-time oracle machines