Efficient Learning Algorithms Yield Circuit Lower Bounds-Reference-Cited by-同舟云学术

Efficient Learning Algorithms Yield Circuit Lower Bounds

Published:2006 Issue: Volume: Page:350-363
ISSN:0302-9743
Container-title:Learning Theory
language:
Short-container-title:

Author:

Fortnow Lance,Klivans Adam R.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11776420_27.pdf

Reference25 articles.

1. Pitt, L., Valiant, L.: Computational limitations on learning from examples. Journal of the ACM 35, 965–984 (1988)

2. Gold, E.A.: Complexity of automaton identification from given data. Information and Control 37, 302–320 (1978)

3. Alekhnovich, Braverman, Feldman, Klivans, Pitassi: Learnability and automatizability. In: FOCS: IEEE Symposium on Foundations of Computer Science (FOCS) (2004)

4. Kearns, M., Valiant, L.: Cryptographic limitations on learning Boolean formulae and finite automata. Journal of the ACM 41, 67–95 (1994)

5. Kharitonov, M.: Cryptographic hardness of distribution-specific learning. In: Proceedings of the Twenty-Fifth Annual Symposium on Theory of Computing, pp. 372–381 (1993)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Mining Circuit Lower Bound Proofs for Meta-Algorithms;computational complexity;2015-04-21

2. Random arithmetic formulas can be reconstructed efficiently;computational complexity;2014-05-24

3. Random Arithmetic Formulas Can Be Reconstructed Efficiently;2013 IEEE Conference on Computational Complexity;2013-06

4. Exact Learning from Membership Queries: Some Techniques, Results and New Directions;Lecture Notes in Computer Science;2013