A read-once lower bound and a (1, +k)-hierarchy for branching programs

Petr Savický, Stanislav Zák. A read-once lower bound and a (1, +k)-hierarchy for branching programs. Theoretical Computer Science, 238(1-2):347-362, 2000. [doi]

Publication has no abstract