Author:
Beame Paul,Karp Richard,Pitassi Toniann,Saks Michael
Cited by
49 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes;Journal of the ACM;2022-06-27
2. Tradeoffs for small-depth Frege proofs;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
3. An Improved Generator for 3-CNF Formulas;Automation and Remote Control;2020-01
4. Random Θ(log n)-CNFs Are Hard for Cutting Planes;2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS);2017-10
5. Strongly refuting random CSPs below the spectral threshold;Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing;2017-06-19