Feasible Functions over Co-inductive Data

DOI10.1007/978-3-642-13824-9_16zbMath1305.68088OpenAlexW1538102167MaRDI QIDQ4931600

Daniel Leivant, Ramyaa Ramyaa

Publication date: 29 September 2010

Published in: Logic, Language, Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13824-9_16

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Functionals in proof theory (03F10)

Related Items (2)

Ramified Corecurrence and Logspace ⋮ Characterizing polynomial time complexity of stream programs using interpretations

This page was built for publication: Feasible Functions over Co-inductive Data