Counting interval sizes in the poset of monotone Boolean functions

Abstract

We focus on the computational aspects of counting interval sizes in the poset $D_n$, which represents all monotone Boolean functions of $n$ variables. We present a resource-aware algorithm enabling the calculation of interval sizes in $D_7$.