来就得意
发表于 2025-4-2 19:28:29
Finding a School for Our Daughtere of any circuit computing the cyclic convolution. For depth-2 circuits, a lower bound .(..) for the same function was obtained in our previous paper . Here we present an improved proof of this bound. Both lower bounds are the best known for depth-3 and depth-2 circuits, respectively.
exhilaration
发表于 2025-4-3 03:27:09
https://doi.org/10.1007/978-3-540-79709-8Automat; Hardware; algorithms; artificial intelligence; automata; complexity; computer architecture; comput