A higher-order characterization of probabilistic polynomial time

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 12. Analogously, a (less implicit) characterization of the class BPP can be obtained. RSLR is an extension of Hofmann...

Celý popis

Podrobná bibliografia

Vydané v:	Information and computation Ročník 241; s. 114 - 141
Hlavní autori:	Dal Lago, Ugo, Parisen Toldin, Paolo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.04.2015 Elsevier
Predmet:	Computer Science Implicit computational complexity Logic in Computer Science Probabilistic classes Probabilistic classes Implicit computational complexity Linear types Lambda calculus
ISSN:	0890-5401, 1090-2651
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!