A Higher-Order Characterization of Probabilistic Polynomial Time - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Information and Computation Year : 2015

A Higher-Order Characterization of Probabilistic Polynomial Time

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.
Fichier principal
Vignette du fichier
main.pdf (534.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01231752 , version 1 (17-12-2013)
hal-01231752 , version 2 (20-11-2015)

Identifiers

Cite

Ugo Dal Lago, Paolo Parisen. A Higher-Order Characterization of Probabilistic Polynomial Time. Information and Computation, 2015, 241, pp.114-141. ⟨10.1016/j.ic.2014.10.009⟩. ⟨hal-01231752v2⟩
117 View
285 Download

Altmetric

Share

Gmail Facebook X LinkedIn More