Author:
Fortnow Lance,Klivans Adam R.
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference37 articles.
1. M. Alekhnovich, M. Braverman, V. Feldman, A. Klivans, T. Pitassi, Learnability and automatizability, in: FOCS, IEEE Symposium on Foundations of Computer Science (FOCS), 2004
2. On pseudorandomness and resource-bounded measure;Arvind;Theoret. Comput. Sci.,2001
3. Queries and concept learning;Angluin;Mach. Learn.,1988
4. S. Aaronson, A. Wigderson, Algebrization: A new barrier in complexity theory, Manuscript, 2007
5. On interpolating arithmetic read-once formulas with exponentiation;Bshouty;J. Comput. System Sci.,1998
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Power of Natural Properties as Oracles;computational complexity;2023-07-06
2. On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds;Journal of the ACM;2023-04-20
3. Quantum learning algorithms imply circuit lower bounds;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
4. Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
5. Learning sums of powers of low-degree polynomials in the non-degenerate case;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11