Tensor trains are provably more succinct than OBDDs as Boolean function representations and support the same polynomial-time queries and transformations.
Title resolution pending
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
-
Tensor Decomposition Meets Knowledge Compilation: A Study Comparing Tensor Trains with OBDDs
Tensor trains are provably more succinct than OBDDs as Boolean function representations and support the same polynomial-time queries and transformations.