Computing n-Dimensional Volumes of Complexes: Application to Constructive Entropy Bounds
Valeriu C. Beiu, Hanna Makaruk · University of North Texas Digital Library (University of North Texas) · 1997
Constructive bounds on the needed number-of-bits (entropy) for solving a dichotomy problem can be represented by a quotient of two volumes of multidimensional solids. Exact methods for the calculation of these volumes are presented. They lead to a tighter lower bound on the needed number-of-bits than the ones previously known.