A syntactical analysis of non-size-increasing polynomial time computation
Klaus Aehlig, Helmut Schwichtenberg
Abstract
A syntactical proof is given that all functions definable in a certain affine linear typed lambda-calculus with iteration in all types are polynomial time computable. The proof provides explicit polynomial bounds that can easily be calculated.
Create a lesson
Related papers
Finite Satisfiability of Two-Variable Logic with Arbitrarily Many Successors
Artur Jeż, Jakub Michaliszyn, Piotr Witkowski
A Non-Dichotomy for CSPs of Stable ω-Categorical Structures
Manuel Bodirsky, David Bradley-Williams, Ehud Hrushovski et al.
Non-Wellfounded and Cyclic Proofs for LTL: A Syntactic Correspondence with Linear Nested Sequents
Tim S. Lyon, Lukas Zenger
Finite-on-Top-of-Temporal CSPs in Fixed-Point Logic
Manuel Bodirsky, Philipp A. Grzywaczyk
The Complexity of Verifying Strategic Abilities in Succinct Multiagent Systems
Yifan He, Munyque Mittelmann, Aniello Murano et al.
Reset Early, Reset Often, Eliminate Models
Martin S. Fixman, Fredrik Rømming, Sean B. Holden