Proving that \(\mathrm{prBPP}=\mathrm{prP}\) is as hard as proving that ``almost NP'' is not contained in P/poly (Q2328311)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Proving that \(\mathrm{prBPP}=\mathrm{prP}\) is as hard as proving that ``almost NP'' is not contained in P/poly
scientific article

    Statements

    Proving that \(\mathrm{prBPP}=\mathrm{prP}\) is as hard as proving that ``almost NP'' is not contained in P/poly (English)
    0 references
    0 references
    10 October 2019
    0 references
    computational complexity
    0 references
    derandomization
    0 references
    circuit lower bounds
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references