scientific article; zbMATH DE number 2061714

MaRDI QIDQ4457461zbMATH OpenFDO

Authors François Maurel

Publication date 22 March 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2701/27010241.htm

zbMATH Keywords

NP complexitylight logicsimplicit characterisations of complexity classes

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cut-elimination and normal-form theorems (03F05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• On light logics, uniform encodings and polynomial time
• Soft linear logic and polynomial complexity classes
• Linear logic and polynomial time
• Theoretical Computer Science
• A Semantic Proof of Polytime Soundness of Light Affine Logic

Cited in

(6)

• An exact correspondence between a typed pi-calculus and polarised proof-nets
• scientific article; zbMATH DE number 1424054 (Why is no real title available?)
• Type inference for light affine logic via constraints on words
• Soft linear logic and polynomial complexity classes
• Linear additives
• Coherent interaction graphs

This page was built for publication:

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