In the paper we investigate a model for computing of Boolean functions - Ordered Binary Decision Diagrams (OBDDs), which is a restricted version of Branching Programs. We present several results on the comparative complexity ...