Applicable Analysis and Discrete Mathematics, Vol. 10, No. 2 (October 2016), pp. 408-446 (39 pages) An associative Boolean tree is a plane rooted tree whose internal nodes are labelled by AND or OR ...

This is a preview. Log in through your library . Abstract Jensen gave a lower bound to Eρ(T), where ρ is a convex function of the random vector T. Madansky has obtained an upper bound via the theory ...