Probabilistic Recursion Theory and Implicit Computational Complexity
From MaRDI portal
Publication:2938155
DOI10.1007/978-3-319-10882-7_7zbMath1423.03137OpenAlexW2160232022MaRDI QIDQ2938155
Publication date: 13 January 2015
Published in: Theoretical Aspects of Computing – ICTAC 2014 (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01091595/file/main.pdf
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (1)
This page was built for publication: Probabilistic Recursion Theory and Implicit Computational Complexity
