Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus - Theoretical Computer Science Access content directly
Conference Papers Year : 2014

Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus

Abstract

In this paper an implicit characterization of the complexity classes k-EXP and k-FEXP, for k>=0, is given, by a type assignment system for a stratified lambda-calculus, where types for programs are witnesses of the corresponding complexity class. Types are formulae of Elementary Linear Logic (ELL), and the hierarchy of complexity classes k-EXP is characterized by a hierarchy of types. (This on-line version contains an appendix of 14 pages with full proofs of the statements)
Fichier principal
Vignette du fichier
main.pdf (324.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01015171 , version 1 (25-06-2014)
hal-01015171 , version 2 (24-11-2016)

Identifiers

  • HAL Id : hal-01015171 , version 1

Cite

Patrick Baillot, Erika de Benedetti, Simona Ronchi Della Rocca. Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus. IFIP conference on Theoretical Computer Science, Aug 2014, Rome, Italy. 15 p. ⟨hal-01015171v1⟩
437 View
566 Download

Share

Gmail Facebook X LinkedIn More