Author:
Alekhnovich Misha,Braverman Mark,Feldman Vitaly,Klivans Adam R.,Pitassi Toniann
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference31 articles.
1. M. Alekhnovich, S. Khot, T. Pitassi, Inapproximability of fixed parameter problems, 2004, manuscript
2. M. Alekhnovich, A. Razborov, Resolution is not automatizable unless w[p] is tractable, in: IEEE Symposium on Foundations of Computer Science, 2001
3. Occam's razor;Blumer;Inform. Process. Lett.,1987
4. P. Beame, R. Karp, T. Pitassi, M. Saks, On the complexity of unsatisfiability of random k-CNF formulas, in: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, Dallas, TX, May 1998, pp. 561–571
5. Lower bounds for cutting planes proofs with small coefficients;Bonet;J. Symbolic Logic,1997
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Properly learning decision trees with queries is NP-hard;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. A strong composition theorem for junta complexity and the boosting of property testers;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. NP-Hardness of Learning Programs and Partial MCSP;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
4. Constant Depth Formula and Partial Function Versions of MCSP Are Hard;SIAM Journal on Computing;2022-08-31
5. The hardest halfspace;computational complexity;2021-08-03