Computational aspects of Boolean cubature (Q1895977)

A \(d\)-variate Boolean trapezoidal rule is defined as a linear combination of \(d\)-variate tensor product trapezoidal rules: \[ H^{q,d} [f] = \sum^{d-1}_{j=0} (-1)^j {d - 1\choose j} \sum_{k_1 + \dots + k_d = q - j} T(k_1, \dots, k_d) [f]. \] A \(d\)-variate Boolean midpoint rule is constructed similarly. It is shown: One can compute Boolean trapezoidal rules efficiently by a modification of these Boolean midpoint sums.