scientific article; zbMATH DE number 1156868

MaRDI QIDQ4390865zbMATH OpenFDO

Authors Luca Trevisan, Andrea Clementi, José Rolim

Publication date 26 May 1998

zbMATH Keywords

randomness

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1559537
• Proving that \(\mathrm{prBPP}=\mathrm{prP}\) is as hard as proving that ``almost NP is not contained in P/poly
• scientific article; zbMATH DE number 1789922
• A decisive characterization of BPP
• In a world of \(\mathrm{P}=\mathrm{BPP}\)

Cited in

(3)

• Proving that \(\mathrm{prBPP}=\mathrm{prP}\) is as hard as proving that ``almost NP is not contained in P/poly
• Approximate inference in Bayesian networks: parameterized complexity results
• Another Proof That $\mathcal{BPP}\subseteq \mathcal{PH}$ (and More)

This page was built for publication:

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