Lower bounds on the complexity of 1-time only branching programs

Paul E. Dunne. Lower bounds on the complexity of 1-time only branching programs. 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 90-99, Springer, 1985.

Abstract

Abstract is missing.