scientific article; zbMATH DE number 2061714

zbMath1039.68054MaRDI QIDQ4457461

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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)

Related Items (4)

Unnamed Item ⋮ Type inference for light affine logic via constraints on words ⋮ An exact correspondence between a typed pi-calculus and polarised proof-nets ⋮ Soft Linear Logic and Polynomial Complexity Classes

This page was built for publication: