License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2021.35
URN: urn:nbn:de:0030-drops-144754
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/14475/
Dal Lago, Ugo ;
Kahle, Reinhard ;
Oitavem, Isabel
A Recursion-Theoretic Characterization of the Probabilistic Class PP
Abstract
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.
BibTeX - Entry
@InProceedings{dallago_et_al:LIPIcs.MFCS.2021.35,
author = {Dal Lago, Ugo and Kahle, Reinhard and Oitavem, Isabel},
title = {{A Recursion-Theoretic Characterization of the Probabilistic Class PP}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {35:1--35:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14475},
URN = {urn:nbn:de:0030-drops-144754},
doi = {10.4230/LIPIcs.MFCS.2021.35},
annote = {Keywords: Implicit complexity, tree-recursion, probabilistic classes, polynomial time, PP}
}
Keywords: |
|
Implicit complexity, tree-recursion, probabilistic classes, polynomial time, PP |
Collection: |
|
46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) |
Issue Date: |
|
2021 |
Date of publication: |
|
18.08.2021 |