On the size of randomized OBDDs and read-once branching programs for k-stable functions.

Martin Sauerhoff On the size of randomized OBDDs and read-once branching programs for k-stable functions. 155-178 2001 10 Computational Complexity 2 http://link.springer.de/link/service/journals/00037/bibs/1010002/10100155.htm db/journals/cc/cc10.html#Sauerhoff01