Lance Fortnow, Rahul Santhanam, “Robust simulations and significant separations”, Information and Computation, 256, 2017, 149
Scott Aaronson, “Algorithms for Boolean Function Query Properties”, SIAM J. Comput., 32, № 5, 2003, 1140
Eric Allender, Bireswar Das, 8635, Mathematical Foundations of Computer Science 2014, 2014, 25
Brynmor Chapman, Ryan Williams, Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015, 263
Arto Annila, “Physical Portrayal of Computational Complexity”, ISRN Computational Mathematics, 2012, 2012, 1
M. Alekhnovich, A. Borodin, J. Buresh-Oppenheim, R. Impagliazzo, A. Magen, T. Pitassi, 20th Annual IEEE Conference on Computational Complexity (CCC'05), 2005, 308
Rahul Ilango, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, 424
Frederic Green, Daniel Kreymer, Emanuele Viola, “Block-symmetric polynomials correlate with parity better than symmetric”, comput. complex., 26, № 2, 2017, 323
A. Kolokolova, “Expressing versus Proving: Relating Forms of Complexity in Logic”, Journal of Logic and Computation, 22, № 2, 2012, 267
Shuichi Hirahara, Osamu Watanabe, 12000, Complexity and Approximation, 2020, 67