R. G. Nigmatullin. Are lower bounds on the complexity lower bounds for universal circuits. In Lothar Budach, editor, Fundamentals of Computation Theory, FCT 85, Cottbus, GDR, September 9-13, 1985. Volume 199 of Lecture Notes in Computer Science, pages 331-340, Springer, 1985.
Abstract is missing.