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.
Type de document :
Communication dans un congrès
Pena, Ricardo and van Eekelen, Marko and Shkaravska, Olha. Foundational and Practical Aspects of Resource Analysis, 2012, Madrid, Spain. Springer, 7177, pp.1--18, 2012, Lecture Notes in Computer Science. 〈10.1007/978-3-642-32495-6_1〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00909376
Contributeur : Davide Sangiogi <>
Soumis le : mardi 26 novembre 2013 - 11:08:20
Dernière modification le : samedi 27 janvier 2018 - 01:30:59

Lien texte intégral

Identifiants

Collections

Citation

Ugo Dal Lago, Paolo Parisen Toldin. A Higher-Order Characterization of Probabilistic Polynomial Time. Pena, Ricardo and van Eekelen, Marko and Shkaravska, Olha. Foundational and Practical Aspects of Resource Analysis, 2012, Madrid, Spain. Springer, 7177, pp.1--18, 2012, Lecture Notes in Computer Science. 〈10.1007/978-3-642-32495-6_1〉. 〈hal-00909376〉

Partager

Métriques

Consultations de la notice

137