Document Open Access Logo

On Sharing, Memoization, and Polynomial Time

Authors Martin Avanzini, Ugo Dal Lago

PDF

File

Thumbnail PDF
PDF
LIPIcs.STACS.2015.62.pdf
  • Filesize: 0.76 MB
  • 14 pages

Document Identifiers

Subject Classification

Keywords
  • implicit computational complexity
  • data-tiering
  • polynomial time

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

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.

Cite As Get BibTex

Martin Avanzini and Ugo Dal Lago. On Sharing, Memoization, and Polynomial Time. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 62-75, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015) https://doi.org/10.4230/LIPIcs.STACS.2015.62

Author Details

Martin Avanzini
Ugo Dal Lago

References

  1. B. Accattoli and U. Dal Lago. On the Invariance of the Unitary Cost Model for Head Reduction. In Proc. of \nrd23 RTA, volume 15 of LIPIcs, pages 22-37. Dagstuhl, 2012. Google Scholar
  2. B. Accattoli and U. Dal Lago. Beta Reduction is Invariant, Indeed. In Joint Proc. of \nrd23 CSL and \nth29 LICS, page 8. ACM, 2014. Google Scholar
  3. T. Arai and N. Eguchi. A New Function Algebra of EXPTIME Functions by Safe Nested Recursion. TOCL, 10(4), 2009. Google Scholar
  4. M. Avanzini and U. Dal Lago. On Sharing, Memoization, and Polynomial Time. Technical report, University of Bologna, 2014. Available at URL: http://arxiv.org/abs/1501.00894.
  5. M. Avanzini and G. Moser. Closing the Gap Between Runtime Complexity and Polytime Computability. In Proc. of \nst21 RTA, volume 6 of LIPIcs, pages 33-48. Dagstuhl, 2010. Google Scholar
  6. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998. Google Scholar
  7. P. Baillot, U. Dal Lago, and J.-Y. Moyen. On Quasi-interpretations, Blind Abstractions and Implicit Complexity. MSCS, 22(4):549-580, 2012. Google Scholar
  8. H. P. Barendregt, M. v. Eekelen, J. R. W. Glauert, J. R. Kennaway, M. J. Plasmeijer, and M. R. Sleep. Term Graph Rewriting. In PARLE (2), volume 259 of LNCS, pages 141-158. Springer, 1987. Google Scholar
  9. S. Bellantoni. Predicative Recursion and Computational Complexity. PhD thesis, University of Toronto, 1992. Google Scholar
  10. S. Bellantoni. Predicative Recursion and the Polytime Hierarchy. In Feasible Mathematics II. Birkhäuser Boston, 1994. Google Scholar
  11. S. Bellantoni and S. Cook. A new Recursion-Theoretic Characterization of the Polytime Functions. CC, 2(2):97-110, 1992. Google Scholar
  12. G. Bonfante, R. Kahle, J.-Y. Marion, and I. Oitavem. Recursion Schemata for NCk. In Proc. of \nnd22 CSL, volume 5213 of LNCS, pages 49-63. Springer, 2008. Google Scholar
  13. G. Bonfante, J.-Y. Marion, and J.-Y. Moyen. Quasi-interpretations: A Way to Control Resources. Theoretical Computer Science, 412(25):2776-2796, 2011. Google Scholar
  14. U. Dal Lago and S. Martini. Derivational Complexity is an Invariant Cost Model. In Revised Selected Papers of \nst1 FOPARA, volume 6324 of LNCS, pages 100-113. Springer, 2009. Google Scholar
  15. U. Dal Lago and S. Martini. On Constructor Rewrite Systems and the Lambda Calculus. LMCS, 8(3):1-27, 2012. Google Scholar
  16. U. Dal Lago, S. Martini, and M. Zorzi. General Ramified Recurrence is Sound for Polynomial Time. In Proc. of \nst1 DICE, volume 23 of EPTCS, pages 47-62, 2010. Google Scholar
  17. N. Danner and J. S. Royer. Ramified Structural Recursion and Corecursion. CoRR, abs/1201.4567, 2012. Google Scholar
  18. N. Hirokawa and G. Moser. Automated Complexity Analysis Based on the Dependency Pair Method. In Proc. of \nth4 IJCAR, volume 5195 of LNAI, pages 364-380. Springer, 2008. Google Scholar
  19. B. Hoffmann. Term Rewriting with Sharing and Memoization. In Proc. of \nrd3 ALP, volume 632 of LNCS, pages 128-142. Springer, 1992. Google Scholar
  20. D. Leivant. Stratified Functional Programs and Computational Complexity. In Proc. of \nth20 POPL, pages 325-333. ACM, 1993. Google Scholar
  21. D. Leivant. Ramified Recurrence and Computational Complexity I: Word Recurrence and Poly-time. In Feasible Mathematics II, volume 13, pages 320-343. Birkhäuser Boston, 1995. Google Scholar
  22. J.-Y. Marion. Analysing the Implicit Complexity of Programs. IC, 183:2-18, 2003. Google Scholar
  23. I. Oitavem. Implicit Characterizations of Pspace. In PTCS, pages 170-190, 2001. Google Scholar
  24. C. H. Papadimitriou. Computational Complexity. Addison Wesley Longman, second edition, 1995. Google Scholar
  25. D. Plump. Essentials of Term Graph Rewriting. ENTCS, 51:277-289, 2001. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact