A matrix-product (tensor-train-like) representation of Boolean functions, built from row-switching matrices, is proven to be a canonical normal form equivalent to quasi-reduced binary decision diagrams.
Here we present an alternative and often more efficient method based on direct sum of the matrices in the BMP representations of f and g
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Matrix Product State Representation of Boolean Functions
A matrix-product (tensor-train-like) representation of Boolean functions, built from row-switching matrices, is proven to be a canonical normal form equivalent to quasi-reduced binary decision diagrams.