Collapse of PP with a semi-random source to BPP

DOI10.1016/S0020-0190(96)00201-3zbMath1336.68091MaRDI QIDQ286973

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

• Unnamed Item
• Unnamed Item
• Generating quasi-random sequences from semi-random sources
• Computational Complexity of Probabilistic Turing Machines