Theoretical Computer Science
From MaRDI portal
Publication:5897348
DOI10.1007/b13810zbMath1257.03091MaRDI QIDQ5897348
Kazushige Terui, Harry G. Mairson
Publication date: 23 February 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13810
03D15: Complexity of computation (including implicit computational complexity)
03F05: Cut-elimination and normal-form theorems
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
03F52: Proof-theoretic aspects of linear logic and other substructural logics
Related Items
Encodings of Turing machines in linear logic, Implicit computation complexity in higher-order programming languages, Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic, The role of polymorphism in the characterisation of complexity by soft types, Light linear logics with controlled weakening: expressibility, confluent strong normalization, Light affine lambda calculus and polynomial time strong normalization, Linear logic by levels and bounded time complexity, Polynomial time in untyped elementary linear logic, A type-assignment of linear erasure and duplication, A By-Level Analysis of Multiplicative Exponential Linear Logic, Light Linear Logic with Controlled Weakening