A Local Criterion for Polynomial-Time Stratified Computations

DOI10.1007/978-3-642-15331-0_8zbMath1306.03016OpenAlexW2127875802MaRDI QIDQ5747634

Luca Vercelli, Luca Roversi

Publication date: 14 September 2010

Published in: Foundational and Practical Aspects of Resource Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15331-0_8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Structure of proofs (03F07) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Complexity of proofs (03F20)

Related Items (3)

Paths-based criteria and application to linear logic subsystems characterizing polynomial time ⋮ A type-assignment of linear erasure and duplication ⋮ Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic

This page was built for publication: A Local Criterion for Polynomial-Time Stratified Computations