Alexander A. Sherstov, “Breaking the Minsky–Papert Barrier for Constant-Depth Circuits”, SIAM J. Comput., 47, no. 5, 2018, 1809
M. Krause, P. Pudlak, Proceedings of IEEE 36th Annual Foundations of Computer Science, 1995, 682
Xi Chen, Igor C. Oliveira, Rocco A. Servedio, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017, 1232
Kenneth W. Regan, Complexity Theory Retrospective II, 1997, 261
Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis, Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022, 874
Matthias Krause, 2285, STACS 2002, 2002, 372
Владимир Владимирович Подольский, Vladimir Vladimirovich Podolskii, Александр Александрович Шерстов, Aleksander Aleksandrovich Sherstov, “Небольшое уменьшение степени многочлена с заданной знаковой функцией может экспоненциально увеличить его вес и длину”, Матем. заметки, 87, no. 6, 2010, 885
Arkadev Chattopadhyay, Nikhil S. Mande, “A Short List of Equalities Induces Large Sign-Rank”, SIAM J. Comput., 51, no. 3, 2022, 820
Matthias Krause, Stefan Lucks, 2010, STACS 2001, 2001, 419
Ghaith Hammouri, Erdinç Öztürk, Berk Sunar, “A tamper-proof and lightweight authentication scheme”, Pervasive and Mobile Computing, 4, no. 6, 2008, 807