Author:
Alekhnovich Michael,Razborov Alexander A.
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Subject
General Mathematics,General Computer Science
Cited by
61 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On computing small variable disjunction branch-and-bound trees;Mathematical Programming;2023-05-13
2. Bounded-depth Frege complexity of Tseitin formulas for all graphs;Annals of Pure and Applied Logic;2023-01
3. On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs;Integer Programming and Combinatorial Optimization;2022
4. Automating algebraic proof systems is NP-hard;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
5. Chapter 7. Proof Complexity and SAT Solving;Frontiers in Artificial Intelligence and Applications;2021-02-02