Polynomial time over the reals with parsimony
type: Item
instance of: scholarly article
title: Polynomial time over the reals with parsimony
DOI: 10.1007/978-3-030-59025-3_4
author: Emmanuel Hainry
author: Damiano Mazza
author: Romain Péchoux
publication date: 2021-07-06T00:00:00Z
full work available at URL: main.pdf
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68N18
zbMATH DE Number: 7368084
MaRDI profile type: Publication
OpenAlex ID: W3009846165
cites work: Q3765758
cites work: Q4002474
cites work: Q4485693
cites work: Complexity Theory for Operators in Analysis
cites work: Feasible real random access machines
cites work: A certified, corecursive implementation of exact real numbers
cites work: A Language for Differentiable Functions
cites work: The differential lambda-calculus
cites work: Light linear logic
cites work: Linear types and non-size-increasing polynomial time computation.
cites work: A Soft Type Assignment System for λ-Calculus
cites work: Light types for polynomial time computation in lambda calculus
cites work: Parsimonious Types and Non-uniform Computation
cites work: Simple Parsimonious Types and Logarithmic Space
cites work: Beta reduction is invariant, indeed
cites work: Characterizing polynomial time complexity of stream programs using interpretations
cites work: Algebras and coalgebras in the light affine Lambda calculus
cites work: Infinitary Lambda Calculi from a Linear Perspective
cites work: Q4437079
cites work: The Computational Contents of Ramified Corecurrence
cites work: From coinductive proofs to exact real arithmetic: theory and applications
cites work: Proofs, programs, processes
cites work: A Theory of Program Size Formally Identical to Information Theory
cites work: Type inference for light affine logic via constraints on words
cites work: Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic
cites work: Infinitary lambda calculus
description: scientific article; zbMATH DE number 7368084