Ryan Williams, “Nonuniform ACC Circuit Lower Bounds”, J. ACM, 61:1 (2014), 1
Alexander A. Razborov, The Mathematics of Paul Erdős I, 2013, 425
Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka, “Hard Functions for Low-Degree Polynomials over Prime Fields”, ACM Trans. Comput. Theory, 5:2 (2013), 1
Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka, “Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields”, comput. complex., 22:4 (2013), 679
Arkadev Chattopadhyay, Jacobo Torán, Fabian Wagner, “Graph Isomorphism is Not AC0-Reducible to Group Isomorphism”, ACM Trans. Comput. Theory, 5:4 (2013), 1
А. П. Давыдов, С. И. Николенко, “Схемная сложность линейных функций: метод исключения гейтов и надежность в слабом смысле”, Теория сложности вычислений. X, Зап. научн. сем. ПОМИ, 399, ПОМИ, СПб., 2012, 65–87 ; A. P. Davydow, S. I. Nikolenko, “Circuit complexity of linear functions: gate elimination and feeble security”, J. Math. Sci. (N. Y.), 188:1 (2013), 35–46
Ruiwen Chen, Valentine Kabanets, Lecture Notes in Computer Science, 7434, Computing and Combinatorics, 2012, 408
V. V. Podolskii, “Exponential lower bound for bounded depth circuits with few threshold gates”, Inform. Process. Lett., 112:7 (2012), 267–271
Guy N. Rothblum, Lecture Notes in Computer Science, 7417, Advances in Cryptology – CRYPTO 2012, 2012, 552
Albert Atserias, Anuj Dawar, Lecture Notes in Computer Science, 7392, Automata, Languages, and Programming, 2012, 67