Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs.

Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, Jos D. P. Rolim

Browse the full ICALP paper archive.