1
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Cryptographic limitations on learning Boolean formulae and finite automata

      ,

      Journal of the ACM

      Association for Computing Machinery (ACM)

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Related collections

          Author and article information

          Journal
          Journal of the ACM
          J. ACM
          Association for Computing Machinery (ACM)
          00045411
          January 1994
          : 41
          : 1
          : 67-95
          Article
          10.1145/174644.174647
          f80b6c19-1bc8-47fb-bd94-56ddcdc17f53

          Comments

          Comment on this article