2012/02/15 by Ugo Dal Lago, Lago, Ugo Dal, Paolo Parisen Toldin +1
Computer Science · #Computational Complexity (cs.CC) #F.1.1 #F.1.2 #F.4.1 #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Natural Language Processing Techniques #cs.CC #cs.LO
paper · pdf · doi:10.48550/arxiv.1202.3317
32 pages
arxiv created 2012/02/15 · openalex publication_date 2012/02/15 · arxiv updated 2012/02/16 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
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 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.