Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim. Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs. In Jirí Wiedermann, Peter van Emde Boas, Mogens Nielsen, editors, Automata, Languages and Programming, 26th International Colloquium, ICALP 99, Prague, Czech Republic, July 11-15, 1999, Proceedings. Volume 1644 of Lecture Notes in Computer Science, pages 179-189, Springer, 1999. [doi]
Abstract is missing.