Comments on “Sympathy: fast exact minimization of fixedpolarity Reed-Muller expansion for symmetric functions”

The above paper finds an optimal fixed-polarity Reed-Muller expansion of an n-variable totally symmetric function using an OFDD-based algorithm that requires O(n7) time and O(n6 ) storage space. However, an algorithm based on Suprunʹs transient triangles requires only O(n3) time and O(n2) storage space. An implementation of this algorithm yields computation times lower by several orders of magnitude.