Skip to content
cs-conference-ranking.org

A Superpolynomial Lower Bound for (1, +k(n))-Branching Programs.

Stanislav Zk

VenueBMFCS
Year1995
ProceedingsMFCS
DBLP recordconf/mfcs/Zak95 ↗

Browse the full MFCS paper archive.