A Higher-Order Characterization of Probabilistic Polynomial Time

DOI10.1007/978-3-642-32495-6_1zbMath1367.68103arXiv1202.3317OpenAlexW2101931139MaRDI QIDQ3167522

Paolo Parisen Toldin, Ugo Dal Lago

Publication date: 2 November 2012

Published in: Foundational and Practical Aspects of Resource Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.3317

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (3)

On Equivalences, Metrics, and Polynomial Time ⋮ Combining linear logic and size types for implicit complexity ⋮ Unnamed Item

This page was built for publication: A Higher-Order Characterization of Probabilistic Polynomial Time