The Computational Contents of Ramified Corecurrence

DOI10.1007/978-3-662-46678-0_27zbMath1459.68070OpenAlexW2100145014MaRDI QIDQ2949456

Ramyaa Ramyaa, Daniel Leivant

Publication date: 1 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46678-0_27

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Unnamed Item ⋮ Polynomial time over the reals with parsimony

This page was built for publication: The Computational Contents of Ramified Corecurrence