In the manuscript F. Ablayev and M. Karpinski, On the power of randomized branching programs (generalization of ICALP'96 paper results for the case of pure boolean function, available at http://www.ksu.ru/~ablayev) we exhibited a simple boolean functions $f_n$ in $n$ variables such that: 1) $f_{n}$ can be computed by polynomial size ... more >>>