ALLSAT compressed with wildcards: Partitionings and face-numbers of simplicial complexes.
Marcel Wild · arXiv (Cornell University) · 2018
Given the facets of a finite simplicial complex, we use wildcards to enumerate its faces in compressed fashion. Our algorithm, coded in high-level Mathematica code, compares favorably to the hardwired Mathematica command BooleanConvert (=exclusive sums of products). As to running time, depending on the particular problem instance, either method can excel. When our method wins it may not just beat BooleanConvert but also SatisfiabilityCount (although the latter is only asked to c o u n t). Independent of running time, our compression rate is always higher.