Andrzej Lingas. Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution. In T. V. Gopal, Gerhard Jäger, Silvia Steila, editors, Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20-22, 2017, Proceedings. Volume 10185 of Lecture Notes in Computer Science, pages 401-411, 2017. [doi]
Abstract is missing.