Author:
Atserias Albert,Lauria Massimo
Publisher
Springer International Publishing
Reference24 articles.
1. Atserias, A., Hakoniemi, T.: Size-degree trade-offs for sums-of-squares and Positivstellensatz proofs. To appear in Proceedings of 34th Annual Conference on Computational Complexity (CCC 2019) (2019). Long version in
arXiv:1811.01351
[cs.CC] 2018
2. Atserias, A., Lauria, M.: Circular (yet sound) proofs. CoRR, abs/1802.05266 (2018)
3. Atserias, A., Lauria, M., Nordström, J.: Narrow proofs may be maximally long. ACM Trans. Comput. Log. 17(3), 19:1–19:30 (2016)
4. Au, Y.H., Tunçel, L.: A comprehensive analysis of polyhedral lift-and-project methods. SIAM J. Discrete Math. 30(1), 411–451 (2016)
5. Ben-Sasson, E., Wigderson, A.: Short proofs are narrow - resolution made simple. J. ACM 48(2), 149–169 (2001)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Separations in Proof Complexity and TFNP;Journal of the ACM;2024-08
2. Circular (Yet Sound) Proofs in Propositional Logic;ACM Transactions on Computational Logic;2023-04-07
3. MaxSAT Resolution and Subcube Sums;ACM Transactions on Computational Logic;2023-01-18
4. Separations in Proof Complexity and TFNP;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
5. Proof Complexity for the Maximum Satisfiability Problem and its Use in SAT Refutations;Journal of Logic and Computation;2022-03-01