A higher-order characterization of probabilistic polynomial time

  • Authors:

  • Ugo Dal Lago;Paolo Parisen Toldin

  • Affiliations:

  • Dipartimento di Scienze dell'Informazione, Università di Bologna, Équipe FOCUS, INRIA Sophia Antipolis, Bologna, Italy;Dipartimento di Scienze dell'Informazione, Università di Bologna, Équipe FOCUS, INRIA Sophia Antipolis, Bologna, Italy

  • Venue:
  • FOPARA'11 Proceedings of the Second international conference on Foundational and Practical Aspects of Resource Analysis
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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 $\frac{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.