Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution (Q1894721)

From MaRDI portal
Revision as of 23:05, 28 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution
scientific article

    Statements

    Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution (English)
    0 references
    0 references
    29 April 1996
    0 references
    learning \(AC^ 1\) circuits
    0 references
    pseudo-random function generator
    0 references

    Identifiers