An Higher-Order Characterization of Probabilistic Polynomial Time - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Information and Computation Année : 2013

An Higher-Order Characterization of Probabilistic Polynomial Time

Résumé

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 one half. 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.

Domaines

Informatique
Fichier principal
Vignette du fichier
ic2013.pdf (330.67 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

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

Identifiants

  • HAL Id : hal-01231752 , version 1

Citer

Ugo Dal Lago, Paolo Parisen Toldin. An Higher-Order Characterization of Probabilistic Polynomial Time. Information and Computation, 2013. ⟨hal-01231752v1⟩
122 Consultations
286 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More