Level-p-complexity of Boolean functions using thinning, memoization, and polynomials

J Jansson, P Jansson - Journal of Functional Programming, 2023 - cambridge.org
This paper describes a purely functional library for computing level-p-complexity of Boolean
functions and applies it to two-level iterated majority. Boolean functions are simply functions …