A decisive characterization of BPP
DOI10.1016/S0019-9958(86)80044-4zbMath0616.68049OpenAlexW1967159037WikidataQ60060630 ScholiaQ60060630MaRDI QIDQ4725751
Publication date: 1986
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(86)80044-4
Turing machinesprobabilistic algorithmsrandom oracleprobabilistic classesrandom quantifiercomplexity class BPPpolynomial-time predicate
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10) Algorithms in computer science (68W99)
Related Items (16)
This page was built for publication: A decisive characterization of BPP