Author:
Bonet Maria Luisa,Domingo Carlos,Gavald� Ricard,Maciel Alexis,Pitassi Toniann
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Cited by
59 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Automating algebraic proof systems is NP-hard;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
2. The canonical pairs of bounded depth Frege systems;Annals of Pure and Applied Logic;2021-02
3. Automating Tree-Like Resolution in Time n(log ) Is ETH-Hard;Procedia Computer Science;2021
4. Automating Resolution is NP-Hard;Journal of the ACM;2020-10-16
5. Automating cutting planes is NP-hard;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06