Author:
Lauria Massimo,Nordström Jakob
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference34 articles.
1. Albert Atserias, Massimo Lauria & Jakob Nordström (2016). Narrow Proofs May Be Maximally Long. ACM Transactions on Computational Logic 17, 19:1–19:30. Preliminary version in CCC ’14.
2. Albert Atserias, Moritz Müller & Sergi Oliva (2015). Lower Bounds for DNF-refutations of a Relativized Weak Pigeonhole Principle. Journal of Symbolic Logic 80(2), 450–476. Preliminary version in CCC ’13.
3. Boaz Barak, Fernando G. S. L. Brandão, Aram Wettroth Harrow, Jonathan A. Kelner, David Steurer & Yuan Zhou (2012). Hypercontractivity, Sum-of-Squares Proofs, and Their Applications. In Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC ’12), 307–326.
4. Boaz Barak & David Steurer (2014). Sum-of-Squares Proofs and the Quest Toward Optimal Algorithms. Technical Report TR14-059, Electronic Colloquium on Computational Complexity (ECCC).
5. Paul Beame, Russell Impagliazzo, Jan Krajíček, Toniann Pitassi & Pavel Pudlák (1994). Lower Bounds on Hilbert’s Nullstellensatz and Propositional Proofs. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS ’94), 794–806.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献