Alexander A. Sherstov, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, 2007, 294
Alexander A. Razborov, Alexander A. Sherstov, “The Sign-Rank of AC$^0$”, SIAM J. Comput., 39, no. 5, 2010, 1833
Maarten Van den Nest, “Quantum matchgate computations and linear threshold gates”, Proc. R. Soc. A., 467, no. 2127, 2011, 821
Aryeh Grinberg, Ronen Shaltiel, Emanuele Viola, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018, 956
Adam R. Klivans, Rocco A. Servedio, “Learning DNF in time 2Õ(n1/3)”, Journal of Computer and System Sciences, 68, no. 2, 2004, 303
Hamidreza Jahanjou, Eric Miles, Emanuele Viola, “Local reduction”, Information and Computation, 261, 2018, 281
R.A. Servedio, 21st Annual IEEE Conference on Computational Complexity (CCC'06), 2006, 18
Vladimir V Podol'skii, Aleksander A Sherstov, “Reducing by 1 the degree of a polynomial with fixed sign function can increase exponentially its weight and length”, Russ. Math. Surv., 64, no. 5, 2009, 950
Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii, 8087, Mathematical Foundations of Computer Science 2013, 2013, 516
Roozbeh Farhoodi, Khashayar Filom, Ilenna Simone Jones, Konrad Paul Kording, “On Functions Computed on Trees”, Neural Computation, 31, no. 11, 2019, 2075