Valeriu Beiu, John G. Taylor, “On the Circuit Complexity of Sigmoid Feedforward Neural Networks”, Neural Networks, 9, № 7, 1996, 1155
Amir Jafari, Shahram Khazaei, “On Abelian and Homomorphic Secret Sharing Schemes”, J Cryptol, 34, № 4, 2021, 43
Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran, 12552, Theory of Cryptography, 2020, 274
Michael J. Freedman, Kobbi Nissim, Benny Pinkas, 3027, Advances in Cryptology - EUROCRYPT 2004, 2004, 1
Matthias P. Krieger, 3623, Fundamentals of Computation Theory, 2005, 32
Ren� Peeters, “Orthogonal representations over finite fields and the chromatic number of graphs”, Combinatorica, 16, № 3, 1996, 417
Amos Beimel, Enav Weinreb, “Separating the Power of Monotone Span Programs over Different Fields”, SIAM J. Comput., 34, № 5, 2005, 1196
Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma, “Characterization and Lower Bounds for Branching Program Size using Projective Dimension”, ACM Trans. Comput. Theory, 11, № 2, 2019, 1
Toniann Pitassi, Robert Robere, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017, 1246
Tomás Feder, Eyal Kushilevitz, Moni Naor, Noam Nisan, “Amortized Communication Complexity”, SIAM J. Comput., 24, № 4, 1995, 736