Polynomial time calculi.

MaRDI QIDQ3628772zbMATH OpenFDO

Authors Stefan Schimanski

Publication date 25 May 2009

Full work available at URL http://edoc.ub.uni-muenchen.de/9910/

Mathematics Subject Classification ID

Logic in computer science (03B70) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05)

Recommendations

• Light types for polynomial time computation in lambda calculus
• Combining linear logic and size types for implicit complexity
• A polytime functional language from light linear logic
• Linear logic and polynomial time
• From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing

Cited in

(4)

• Combining linear logic and size types for implicit complexity
• Algebras and coalgebras in the light affine lambda calculus
• ML with PTIME complexity guarantees
• scientific article; zbMATH DE number 2221549 (Why is no real title available?)

This page was built for publication: Polynomial time calculi.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3628772)