scientific article; zbMATH DE number 7566046
From MaRDI portal
Publication:5094117
Jean-Yves Marion, Emmanuel Hainry, Romain Péchoux, Bruce M. Kapron
Publication date: 2 August 2022
Full work available at URL: https://arxiv.org/abs/2102.11605
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Higher-order interpretations and program complexity
- Quasi-interpretations. A way to control resources
- Functional interpretations of feasibly constructive arithmetic
- Light types for polynomial time computation in lambda calculus
- Linear logic by levels and bounded time complexity
- A new recursion-theoretic characterization of the polytime functions
- Polynomial and abstract subrecursive classes
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Light linear logic
- Type-two polynomial-time and restricted lookahead
- Characterizing polynomial time complexity of stream programs using interpretations
- On characterizations of the basic feasible functionals, Part I
- A flow calculus of mwp -bounds for complexity analysis
- A logical account of pspace
- Objects in Polynomial Time
- Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
- On the Complexity of Timetable and Multicommodity Flow Problems
- Higher order interpretation for higher order complexity
- A new Characterization of Type-2 Feasibility
- Type-Based Complexity Analysis for Fork Processes
- Type inference with simple subtypes
- Polynomial Running Times for Polynomial-Time Oracle Machines
- A tier-based typed programming language characterizing Feasible Functionals
- The size-change principle for program termination
- Evolving Graph-Structures and Their Implicit Computational Complexity
- Adventures in time and space
- Complexity Information Flow in a Multi-threaded Imperative Language
This page was built for publication:
