Author:
Beame Paul,Karp Richard,Pitassi Toniann,Saks Michael
Cited by
52 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. Chapter 34. Stochastic Boolean Satisfiability;Frontiers in Artificial Intelligence and Applications;2021-02-02
4. Chapter 6. Incomplete Algorithms;Frontiers in Artificial Intelligence and Applications;2021-02-02
5. Chapter 1. A History of Satisfiability;Frontiers in Artificial Intelligence and Applications;2021-02-02