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

Home

❯

refs

❯

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 (2 January 1994), pp 67–95.

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


Graph View

Backlinks

  • Michael Kearns
  • Leslie Valiant
  • Journal of the ACM (JACM)
  • Probable approximate correctness
  • The asymptotics of language