Nachum Dershowitz, Iddo Tzameret, “Complexity of propositional proofs under a promise”, ACM Trans. Comput. Logic, 11, no. 3, 2010, 1
Ryan O'Donnell, Rocco A. Servedio, “Extremal properties of polynomial threshold functions”, Journal of Computer and System Sciences, 74, no. 3, 2008, 298
Jan Krajíček, Proof Complexity, 2019
Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener, 2747, Mathematical Foundations of Computer Science 2003, 2003, 612
Emanuele Viola, “Pseudorandom Bits for Constant‐Depth Circuits with Few Arbitrary Symmetric Gates”, SIAM J. Comput., 36, no. 5, 2007, 1387
Aryeh Grinberg, Ronen Shaltiel, Emanuele Viola, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018, 956
W. T. Gowers, Visions in Mathematics, 2010, 79
Stasys Jukna, “Disproving the Single Level Conjecture”, SIAM J. Comput., 36, no. 1, 2006, 83
Ryan Williams, 2011 IEEE 26th Annual Conference on Computational Complexity, 2011, 115
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, 1069