A Higher-Order Characterization of Probabilistic Polynomial Time

Ugo Dal Lago 1, 2 Paolo Parisen Toldin 1, 2
2 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : We present RSLR, an implicit higher-order characterization of the class PP of those problems which can be decided in probabilistic polynomial time with error probability smaller than 1/2. Analogously, a (less implicit) characterization of the class BPP can be obtained. RSLR is an extension of Hofmann's SLR with a probabilistic primitive, which enjoys basic properties such as subject reduction and confluence. Polynomial time soundness of RSLR is obtained by syntactical means, as opposed to the standard literature on SLR-derived systems, which use semantics in an essential way.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-00909376
Contributor : Davide Sangiogi <>
Submitted on : Tuesday, November 26, 2013 - 11:08:20 AM
Last modification on : Saturday, January 27, 2018 - 1:30:59 AM

Links full text

Identifiers

Collections

Citation

Ugo Dal Lago, Paolo Parisen Toldin. A Higher-Order Characterization of Probabilistic Polynomial Time. Foundational and Practical Aspects of Resource Analysis, 2012, Madrid, Spain. pp.1--18, ⟨10.1007/978-3-642-32495-6_1⟩. ⟨hal-00909376⟩

Share

Metrics

Record views

166