REVIEW 1 cited by
Fast counting with tensor networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We introduce tensor network contraction algorithms for counting satisfying assignments of constraint satisfaction problems (#CSPs). We represent each arbitrary #CSP formula as a tensor network, whose full contraction yields the number of satisfying assignments of that formula, and use graph theoretical methods to determine favorable orders of contraction. We employ our heuristics for the solution of #P-hard counting boolean satisfiability (#SAT) problems, namely monotone #1-in-3SAT and #Cubic-Vertex-Cover, and find that they outperform state-of-the-art solvers by a significant margin.
Forward citations
Cited by 1 Pith paper
-
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.
Discussion (0). Continue with ORCID to comment.