The complexity of constructing pseudorandom generators from hard functions (Q1766819)

From MaRDI portal
Revision as of 01:02, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of constructing pseudorandom generators from hard functions
scientific article

    Statements

    The complexity of constructing pseudorandom generators from hard functions (English)
    0 references
    0 references
    1 March 2005
    0 references
    Pseudorandom generator
    0 references
    hardness
    0 references
    constant-depth circuit
    0 references
    noise sensitivity
    0 references

    Identifiers