Fetching the paper…
Reading the bibliography…
We introduce tensor network contraction algorithms for counting satisfying assignments of constraint satisfaction problems (#CSPs).
The statistics of dimers on a lattice ,
P. Kasteleyn, · 1961
Earlier work this paper cites.
Dimer problem in statistical mechanics-an exact result ,
H. N. V. Temperley and M. E. Fisher, · 1961
Earlier work this paper cites.
A machine program for theorem-proving ,
M. Davis, G. Logemann and D. Loveland, · 1962
Earlier work this paper cites.
Dimer Statistics and Phase Transitions ,
P. W. Kasteleyn, · 1963
Earlier work this paper cites.
On the Structure of Polynomial Time Reducibility ,
R. E. Ladner, · 1975
Earlier work this paper cites.
The complexity of satisfiability problems ,
T. J. Schaefer, · 1978
Earlier work this paper cites.
A Separator Theorem for Planar Graphs ,
R. J. Lipton and R. E. Tarjan, · 1979
Earlier work this paper cites.
The node-deletion problem for hereditary properties is NP-complete ,
J. M. Lewis and M. Yannakakis, · 1980
Earlier work this paper cites.
Edge-Deletion Problems ,
M. Yannakakis, · 1981
Earlier work this paper cites.
A separator theorem for graphs of bounded genus ,
J. R. Gilbert, J. P. Hutchinson and R. E. Tarjan, · 1984
Earlier work this paper cites.
On the computational complexity of the Jones and Tutte polynomials ,
F. Jaeger, D. L. Vertigan and D. J. A. Welsh, · 1990
Earlier work this paper cites.
Edge Separators of Planar and Outerplanar Graphs With Applications ,
K. Diks, H. Djidjev, O. Sykora and I. Vrto, · 1993
Earlier work this paper cites.
Planar Separators and Parallel Polygon Triangulation ,
M. T. Goodrich, · 1995
Earlier work this paper cites.
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs ,
G. Karypis and V. Kumar, · 1998
Earlier work this paper cites.
Complexity of k-SAT ,
R. Impagliazzo and R. Paturi, · 1999
Earlier work this paper cites.
Counting Models Using Connected Components ,
R. J. Bayardo Jr. and J. D. Pehoushek, · 2000
Earlier work this paper cites.
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs ,
C. Greenhill, · 2000
Earlier work this paper cites.
The Phase Transition in 1-in-k SAT and NAE 3-SAT ,
D. Achlioptas, A. Chtcherba, G. Istrate and C. Moore, · 2001
Earlier work this paper cites.
Analytic and Algorithmic Solution of Random Satisfiability Problems ,
M. Mézard, G. Parisi and R. Zecchina, · 2002
Earlier work this paper cites.
Constraint Satisfaction by Survey Propagation (2), 8 (2002),
A. Braunstein, M. Mézard, M. Weigt and R. Zecchina, · 2002
Earlier work this paper cites.
The complexity of tensor calculus ,
C. Damm, M. Holzer and P. McKenzie, · 2002
Earlier work this paper cites.
Community structure in social and biological networks ,
M. Girvan and M. E. J. Newman, · 2002
Earlier work this paper cites.
Survey propagation: An algorithm for satisfiability ,
A. Braunstein, M. Mézard and R. Zecchina, · 2005
Earlier work this paper cites.
Heuristics for Fast Exact Model Counting ,
T. Sang, P. Beame and H. Kautz, · 2005
Earlier work this paper cites.
Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence ,
F. Viger and M. Latapy, · 2005
Earlier work this paper cites.
Classical simulation of quantum many-body systems with a tree tensor network ,
Y.-Y. Shi, L.-M. Duan and G. Vidal, · 2006
Cited alongside, same era.
A Knowledge Compilation Map ,
A. Darwiche and P. Marquis, · 2006
Cited alongside, same era.
sharpSAT – Counting Models with Advanced Component Caching and Implicit BCP ,
M. Thurley, · 2006
Cited alongside, same era.
Valiant’s Holant Theorem and matchgate tensors ,
J.-Y. Cai and V. Choudhary, · 2007
Cited alongside, same era.
Tensor Renormalization Group Approach to Two-Dimensional Classical Lattice Models ,
M. Levin and C. P. Nave, · 2007
Cited alongside, same era.
Phase diagram of the 1-in-3 satisfiability problem ,
J. Raymond, A. Sportiello and L. Zdeborová, · 2007
Cited alongside, same era.
Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints ,
R. Belmonte, P. A. Golovach, P. van ’t Hof and D. Paulusma, · 2013
Later among the works it cites.
Knowledge compilation for model counting: Affine decision trees ,
F. Koriche, J. M. Lagniez, P. Marquis and S. Thomas, · 2013
Later among the works it cites.
A practical introduction to tensor networks: Matrix product states and projected entangled pair states ,
R. Orús, · 2014
Later among the works it cites.
A massively parallel tensor contraction framework for coupled-cluster computations ,
E. Solomonik, D. Matthews, J. R. Hammond, J. F. Stanton and J. Demmel, · 2014
Later among the works it cites.
Tensor Network Renormalization ,
G. Evenbly and G. Vidal, · 2015
Later among the works it cites.
Tensor Network Contractions for #SAT ,
J. D. Biamonte, J. Morton and J. Turner, · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems ,
F. Verstraete, V. Murg and J. Cirac, · 2008
Cited alongside, same era.
Holographic Algorithms ,
L. G. Valiant, · 2008
Cited alongside, same era.
Contraction of matchgate tensor networks on non-planar graphs ,
S. Bravyi, · 2008
Cited alongside, same era.
Entanglement Renormalization and Topological Order ,
M. Aguado and G. Vidal, · 2008
Cited alongside, same era.
Accurate Determination of Tensor Network State of Quantum Lattice Models in Two Dimensions ,
H. C. Jiang, Z. Y. Weng and T. Xiang, · 2008
Cited alongside, same era.
Constraint satisfaction problems with isolated solutions are hard ,
L. Zdeborová and M. Mézard, · 2008
Cited alongside, same era.
Later among the works it cites.
A top-down compiler for sentential decision diagrams ,
U. Oztok and A. Darwiche, · 2015
Later among the works it cites.
Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions ,
A. Cichocki, N. Lee, I. Oseledets, A.-H. Phan, Q. Zhao and D. P. Mandic, · 2016
Later among the works it cites.
Tensor network algorithm by coarse-graining tensor renormalization on finite periodic lattices ,
H.-H. Zhao, Z. Y. Xie, T. Xiang and M. Imada, · 2016
Later among the works it cites.
Recent Advances in Graph Partitioning ,
A. Buluç, H. Meyerhenke, I. Safro, P. Sanders and C. Schulz, · 2016
Later among the works it cites.
Implementing Efficient All Solutions SAT Solvers ,
T. Toda and T. Soh, · 2016
Later among the works it cites.
ASlib: A benchmark library for algorithm selection ,
B. Bischl, P. Kerschke, L. Kotthoff, M. Lindauer, Y. Malitsky, A. Fréchette, H. Hoos, F. Hutter, K. Leyton-Brown, K. Tierney and J. Vanschoren, · 2016
Later among the works it cites.
Tensor Networks in a Nutshell ,
J. D. Biamonte and V. Bergholm, · 2017
Later among the works it cites.
Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 2 Applications and Future Perspectives ,
A. Cichocki, N. Lee, I. Oseledets, A.-H. Phan, Q. Zhao, M. Sugiyama and D. P. Mandic, · 2017
Later among the works it cites.
Algorithms for tensor network renormalization ,
G. Evenbly, · 2017
Later among the works it cites.
Renormalization Group Flows of Hamiltonians Using Tensor Networks ,
M. Bal, M. Mariën, J. Haegeman and F. Verstraete, · 2017
Later among the works it cites.
Loop Optimization for Tensor Network Renormalization ,
S. Yang, Z.-C. Gu and X.-G. Wen, · 2017
Later among the works it cites.
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs ,
S. Har-Peled and K. Quanrud, · 2017
Later among the works it cites.
An Improved Decision-DNNF Compiler ,
J.-M. Lagniez and P. Marquis, · 2017
Later among the works it cites.
Tensor network method for reversible classical computation ,
Z.-C. Yang, S. Kourtis, C. Chamon, E. R. Mucciolo and A. E. Ruckenstein, · 2018
Closest in time.
Quantum-Inspired Boolean States for Bounding Engineering Network Reliability Assessment ,
L. Dueñas-Osorio, M. Vardi and J. Rojo, · 2018
Closest in time.
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems ,
J. Cardinal, J. Nummenpalo and E. Welzl, · 2018
Closest in time.
Renormalization of tensor networks using graph-independent local truncations ,
M. Hauru, C. Delcamp and S. Mizera, · 2018
Closest in time.
Evaluating the Jones polynomial with tensor networks ,
K. Meichanetzidis and S. Kourtis, · 2019
Closest in time.