A tree-decomposition-guided factoring method produces tensor contraction orders with max rank at most ceil(4(w+1)/3), improving the prior 3(w+2) bound and yielding a competitive weighted model counter.
Thurley, SharpSAT: counting models with advanced componen t caching and implicit BCP, in: Proc
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions
A tree-decomposition-guided factoring method produces tensor contraction orders with max rank at most ceil(4(w+1)/3), improving the prior 3(w+2) bound and yielding a competitive weighted model counter.