Titlebook: Computer Science - Theory and Applications; Third International Edward A. Hirsch,Alexander A. Razborov,Anatol Slis Conference proceedings

来就得意

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 [10]. 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

https://doi.org/10.1007/978-3-540-79709-8Automat; Hardware; algorithms; artificial intelligence; automata; complexity; computer architecture; comput