Why is parity hard for estimation of distribution algorithms

We describe a k-bounded and additively separable test problem on which the hierarchical Bayesian Optimization Algorithm (hBOA) scales exponentially. Categories and Subject Descriptors G.1.6 [Numerical Analysis]: Optimization – global optimization