Collapse of PP with a semi-random source to BPP

DOI10.1016/S0020-0190(96)00201-3zbMATH Open1336.68091MaRDI QIDQ286973FDOQ286973

Ryuhei Uehara

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

computational complexitycombinatorial problemsprobabilistic Turing machinessemi-random sources

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Title not available (Why is that?)
• Generating quasi-random sequences from semi-random sources
• Computational Complexity of Probabilistic Turing Machines
• Title not available (Why is that?)

This page was built for publication: Collapse of PP with a semi-random source to BPP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286973)