Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, 109
Scott Aaronson, Open Problems in Mathematics, 2016, 1
Alexander Razborov, “Pseudorandom generators hard for k-DNF resolution and polynomial calculus resolution”, Ann. Math, 181:2 (2015), 415
J.A.. Grochow, “Unifying Known Lower Bounds via Geometric Complexity Theory”, comput. complex, 2015
Joshua A. Grochow, 2014 IEEE 29th Conference on Computational Complexity (CCC), 2014, 274
Pavel Pudlák, Springer Monographs in Mathematics, Logical Foundations of Mathematics and Computational Complexity, 2013, 495
Krajicek J., “A Form of Feasible Interpolation for Constant Depth Frege Systems”, J. Symb. Log., 75:2 (2010), 774–784
Allender E., Kouckuy M., “Amplifying Lower Bounds by Means of Self-Reducibility”, J. ACM, 57:3 (2010), 14
Allender E., “Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds”, Computer Science - Theory and Applications, Lecture Notes in Computer Science, 5010, eds. Hirsch E., Razborov A., Semenov A., Slissenko A., Springer-Verlag Berlin, 2008, 3–10
Pudlak P., “Twelve Problems in Proof Complexity”, Computer Science - Theory and Applications, Lecture Notes in Computer Science, 5010, eds. Hirsch E., Razborov A., Semenov A., Slissenko A., Springer-Verlag Berlin, 2008, 13–27