Probabilistic Recursion Theory and Implicit Computational Complexity - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Probabilistic Recursion Theory and Implicit Computational Complexity

Résumé

We show that probabilistic computable functions, i.e., those functions outputting distributions and computed by probabilistic Turing machines, can be characterized by a natural generalization of Church and Kleene's partial recursive functions. The obtained algebra, following Leivant, can be restricted so as to capture the notion of polytime sampleable distributions, a key concept in average-case complexity and cryptography.
Fichier principal
Vignette du fichier
main.pdf (371.69 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01091595 , version 1 (05-12-2014)

Identifiants

Citer

Ugo Dal Lago, Sara Zuppiroli. Probabilistic Recursion Theory and Implicit Computational Complexity. 11th International Colloquium on Theoretical Aspects of Computing., Sep 2014, Bucharest, Romania. ⟨10.1007/978-3-319-10882-7_7⟩. ⟨hal-01091595⟩

Collections

INRIA INRIA2
105 Consultations
248 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More