Author:
Dantchev Stefan,Ghani Abdul,Martin Barnaby
Publisher
Springer International Publishing
Reference22 articles.
1. Atserias, A., Lauria, M., Nordström, J.: Narrow proofs may be maximally long. ACM Trans. Comput. Log. 17(3), 19:1–19:30 (2016). https://doi.org/10.1145/2898435
2. Barak, B., Steurer, D.: Sum-of-squares proofs and the quest toward optimal algorithms. In: Proceedings of the International Congress of Mathematicians (ICM), vol. IV, pp. 509–533 (2014)
3. Bonacina, I., Galesi, N.: A framework for space complexity in algebraic proof systems. J. ACM 62(3), 23:1–23:20 (2015). https://doi.org/10.1145/2699438
4. Bonacina, I., Galesi, N., Thapen, N.: Total space in resolution. SIAM J. Comput. 45(5), 1894–1909 (2016). https://doi.org/10.1137/15M1023269
5. Lecture Notes in Computer Science;S Buss,1998
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献