On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets

DOI10.1007/978-3-319-12466-7_8zbMath1445.68102arXiv1201.2956OpenAlexW2109858088MaRDI QIDQ3460508

Matthieu Perrinel

Publication date: 7 January 2016

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

Full work available at URL: https://arxiv.org/abs/1201.2956

Mathematics Subject Classification ID

Logic in computer science (03B70) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Complexity of proofs (03F20)

Related Items (2)

Paths-based criteria and application to linear logic subsystems characterizing polynomial time ⋮ On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets

Cites Work

• Linear logic
• Light types for polynomial time computation in lambda calculus
• Linear logic by levels and bounded time complexity
• Light linear logic
• Linear logic and elementary time
• Soft linear logic and polynomial time
• Context semantics, linear logic, and computational complexity
• On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets
• Linear Dependent Types and Relative Completeness
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets