A Recursion-Theoretic Characterization of the Probabilistic Class PP - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

A Recursion-Theoretic Characterization of the Probabilistic Class PP

Résumé

Probabilistic complexity classes, despite capturing the notion of feasibility, have escaped any treatment by the tools of so-called implicit-complexity. Their inherently semantic nature is of course a barrier to the characterization of classes like BPP or ZPP, but not all classes are semantic. In this paper, we introduce a recursion-theoretic characterization of the probabilistic class PP, using recursion schemata with pointers.
Fichier principal
Vignette du fichier
mfcs2021.pdf (704.28 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03346791 , version 1 (16-09-2021)

Identifiants

Citer

Ugo Dal Lago, Reinhard Kahle, Isabel Oitavem. A Recursion-Theoretic Characterization of the Probabilistic Class PP. MFCS 2021 - 46th International Symposium on Mathematical Foundations of Computer Science, Aug 2021, Tallinn, Estonia. ⟨10.4230/LIPIcs.MFCS.2021.35⟩. ⟨hal-03346791⟩
26 Consultations
55 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More