Minimizability of random Boolean functions
Harold Fleisher, J. Giraldi, R. Phoenix, Morton A. Tavel · IEEE Transactions on Computers · 1989
The average number of prime k-cubes and essential k-cubes in an n-variable, single-output Boolean function has already been obtained combinationally. The authors show how the same quantities can be obtained geometrically, using the theory of random clumping and take an initial step in calculating, for k-cubes in the minimized form of a function. The authors compare their results to minimizations produced by ESPRESSO and a cruder algorithm.>