On Sharing, Memoization, and Polynomial Time (Long Version)
classification
💻 cs.CC
keywords
polynomialtimecomputedcostmemoizationsharingadoptionalready
pith:2LERLJBF Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{2LERLJBF}
Prints a linked pith:2LERLJBF badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.