Cryptographic limitations on learning Boolean formulae and finite automata (Q4299296)

From MaRDI portal
Revision as of 20:43, 27 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 598338
Language Label Description Also known as
English
Cryptographic limitations on learning Boolean formulae and finite automata
scientific article; zbMATH DE number 598338

    Statements

    Cryptographic limitations on learning Boolean formulae and finite automata (English)
    0 references
    0 references
    0 references
    1 March 1995
    0 references
    probably approximately correct
    0 references
    public-key cryptosystems
    0 references
    strong intractability
    0 references

    Identifiers