2 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.LO2013★ 1 cited
A polytime complexity analyser for Probabilistic Polynomial Time over imperative stack programs
Jean-Yves Moyen, Paolo Parisen Toldin
We present iSAPP (Imperative Static Analyser for Probabilistic Polynomial Time), a complexity verifier tool that is sound and extensionally complete for the Probabilistic Polynomia…
cs.LO2012★ 2 cited
An Higher-Order Characterization of Probabilistic Polynomial Time (Long Version)
Ugo Dal Lago, Paolo Parisen Toldin
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 th…