البيان رقم صفر

Home

❯

Cryptographic limitations on learning Boolean formulae and finite automata

Cryptographic limitations on learning Boolean formulae and finite automata

Kearns, Michael and Leslie Valiant, ‘Limitations’: ‘Cryptographic limitations on learning Boolean formulae and finite automata’, J. ACM 41.1 (1994), pp 67–95.

journal article · https://doi.org/10.1145/174644.174647


Backlinks

Thesis. The asymptotics of language

1 August 2026

Note. Probable approximate correctness

27 April 2026