Always private
DuckDuckGo never tracks your searches.
Learn More
You can hide this reminder in Search Settings
All regions
Argentina
Australia
Austria
Belgium (fr)
Belgium (nl)
Brazil
Bulgaria
Canada (en)
Canada (fr)
Catalonia
Chile
China
Colombia
Croatia
Czech Republic
Denmark
Estonia
Finland
France
Germany
Greece
Hong Kong
Hungary
Iceland
India (en)
Indonesia (en)
Ireland
Israel (en)
Italy
Japan
Korea
Latvia
Lithuania
Malaysia (en)
Mexico
Netherlands
New Zealand
Norway
Pakistan (en)
Peru
Philippines (en)
Poland
Portugal
Romania
Russia
Saudi Arabia
Singapore
Slovakia
Slovenia
South Africa
Spain (ca)
Spain (es)
Sweden
Switzerland (de)
Switzerland (fr)
Taiwan
Thailand (en)
Turkey
Ukraine
United Kingdom
US (English)
US (Spanish)
Vietnam (en)
Safe search: moderate
Strict
Moderate
Off
Any time
Any time
Past day
Past week
Past month
Past year
  1. site.unibo.it

    "A Recursion-Theoretic Characterization of the Probabilistic Class PP" 46th Mathematical Foundations of Computer Science (MFCS 2021), pp 35:1-12. pdf bib. M. Avanzini and G. Barthe and U. Dal Lago "On Continuation-Passing Transformations and Expected Cost Analysis" Proceedings of the ACM on Programming Languages, 5 (ICFP 2021), pp 87:1-30. pdf bib.
  2. drops.dagstuhl.de

    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 ...
  3. novaresearch.unl.pt

    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.
  4. semanticscholar.org

    A recursion-theoretic characterization of the probabilistic class PP is introduced using recursion schemata with pointers, using recursion schemata with pointers. 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 ...
  5. 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 ...
  6. researchgate.net

    Request PDF | On Aug 11, 2021, Isabel Oitavem and others published A Recursion-Theoretic Characterization of the Probabilistic Class PP | Find, read and cite all the research you need on ResearchGate
  7. ANR Project PPS 19CE480014; 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 ...
  8. novamath.fct.unl.pt

    > A Recursion-Theoretic Characterization of the Probabilistic Class PP. NOVA Math Publications; Algebra and Logic. Proceedings Paper Lago,UD;Kahle,R;Oitavem,I 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia.
  9. Can’t find what you’re looking for?

    Help us improve DuckDuckGo searches with your feedback

Custom date rangeX