| | |
| | |
Stat |
Members: 3643 Articles: 2'488'730 Articles rated: 2609
29 March 2024 |
|
| | | |
|
Article overview
| |
|
ALLSAT compressed with wildcards: Partitionings and face-numbers of simplicial complexes | Marcel Wild
; | Date: |
6 Dec 2018 | Abstract: | 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 shape of the problem, either method can excel. When our method
excels it may not just beat BooleanConvert but also SatisfiabilityCount by
orders of magnitude. Independent of running time, our compression rate is
always higher. | Source: | arXiv, 1812.2570 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |