Author:
De Rezende Susanna F.,Meir Or,Nordström Jakob,Robere Robert
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference73 articles.
1. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov & Avi Wigderson (2002). Space Complexity in Propositional Calculus. SIAM Journal on Computing 31(4), 1184–1211. Preliminary version in STOC '00
2. Joël Alwen & Vladimir Serbinenko (2015). High Parallel Complexity Graphs and Memory-Hard Functions. In Proceedings of the 47th Annual ACM Symposium on Theory of Computing (STOC '15), 595–603
3. Joël Alwen, Susanna F. de Rezende, Jakob Nordström & Marc Vinyals (2017). Cumulative Space in Black-White Pebbling and Resolution. In Proceedings of the 8th Innovations in Theoretical Computer Science Conference (ITCS '17), volume 67 of Leibniz International Proceedings in Informatics (LIPIcs), 38:1–38:21
4. Albert Atserias & Tuomas Hakoniemi (2019). Size-Degree Trade- Offs for Sums-of-Squares and Positivstellensatz Proofs. In Proceedings of the 34th Annual Computational Complexity Conference (CCC '19), volume 137 of Leibniz International Proceedings in Informatics (LIPIcs), 24:1–24:20
5. Albert Atserias, Massimo Lauria & Jakob Nordström (2016). Narrow Proofs May Be Maximally Long. ACM Transactions on Computational Logic 17(3), 19:1–19:30. Preliminary version in CCC '14
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献