Characterizing polynomial and exponential complexity classes in elementary lambda-calculus
Information and Computation(2018)
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 λ-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.
MoreTranslated text
Key words
Implicit computational complexity,Linear logic,Lambda-calculus
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined