Fetching the paper…
Reading the bibliography…
Constrained counting is a fundamental problem in artificial intelligence.
L. G. Valiant, The complexity of enumeration and reliability problems, SICOMP 8 (3) (1979) 410–421
1979
Earlier work this paper cites.
R. Cavallo, M. Pittarelli, The theory of probabilistic databases., in: Proc. of VLDB, 1987, pp. 1–4
1987
Earlier work this paper cites.
A. Swami, A. Gupta, Optimization of large join queries, in: Proc. of SIGMOD, 1988, pp. 8–17
1988
Earlier work this paper cites.
N. Robertson, P. D. Seymour, Graph minors. x. obstructions to tree-decomposition, Journal of Combinatorial Theory, Series B 52 (2) (1991) 153–190
1991
Earlier work this paper cites.
S. Chaudhuri, M. Y. Vardi, Optimization of real conjunctive queries, in: Proc. of PODS, 1993, pp. 59–70
1993
Earlier work this paper cites.
P. D. Seymour, R. Thomas, Call routing and the ratcatcher, Combinatorica 14 (2) (1994) 217–241
1994
Earlier work this paper cites.
R. Dechter, Bucket elimination: A unifying framework for reasoning, Artificial Intelligence 113 (1-2) (1999) 41–85
1999
Earlier work this paper cites.
F. R. Kschischang, B. J. Frey, H.-A. Loeliger, Factor graphs and the sum-product algorithm, IEEE Transactions on information theory 47 (2) (2001) 498–519
2001
Earlier work this paper cites.
V. Dalmau, P. G. Kolaitis, M. Y. Vardi, Constraint satisfaction, bounded treewidth, and finite-variable logics, in: Proc. of CP, 2002, pp. 310–326
2002
Earlier work this paper cites.
F. Bacchus, S. Dalmao, T. Pitassi, Algorithms and complexity results for #SAT and Bayesian inference, in: Proc. of FOCS, 2003, pp. 340–351
2003
Earlier work this paper cites.
S. Hirata, Tensor contraction engine: Abstraction and automated parallel implementation of configuration-interaction, coupled-cluster, and many-body perturbation theories, The Journal of Physical Chemistry A 107 (46) (2003) 9887–9897
2003
Earlier work this paper cites.
R. Dechter, Constraint processing, Morgan Kaufmann, 2003
2003
Earlier work this paper cites.
B. J. McMahan, G. Pan, P. Porter, M. Y. Vardi, Projection pushing revisited, in: Proc. of EDBT, 2004, pp. 441–458
2004
Earlier work this paper cites.
K. Fatahalian, J. Sugerman, P. Hanrahan, Understanding the efficiency of gpu algorithms for matrix-matrix multiplication, in: Proc. of EUROGRAPHICS, ACM, 2004, pp. 133–137
2004
Earlier work this paper cites.
T. Sang, P. Beame, H. Kautz, Heuristics for fast exact model counting, in: Proc. of SAT, 2005, pp. 226–240
2005
Earlier work this paper cites.
K. Kask, R. Dechter, J. Larrosa, A. Dechter, Unifying tree decompositions for reasoning in graphical models, Artificial Intelligence 166 (1-2) (2005) 165–193
2005
Earlier work this paper cites.
F. Viger, M. Latapy, Efficient and simple generation of random simple connected graphs with prescribed degree sequence, in: Proc. of COCOON, 2005, pp. 440–449
2005
Earlier work this paper cites.
M. Thurley, SharpSAT: counting models with advanced component caching and implicit BCP, in: Proc. of SAT, 2006, pp. 424–429
2006
Earlier work this paper cites.
C. Domshlak, J. Hoffmann, Probabilistic planning via heuristic forward search and weighted model counting, Journal of Artificial Intelligence Research 30 (1) (2007) 565–620
2007
Earlier work this paper cites.
B. W. Bader, T. G. Kolda, Efficient matlab computations with sparse and factored tensors, SIAM Journal on Scientific Computing 30 (1) (2007) 205–231
2007
Earlier work this paper cites.
C. Àlvarez, R. Cases, J. Díaz, J. Petit, M. Serna, Communication tree problems, Theoretical computer science 381 (1-3) (2007) 197–217
2007
Cited alongside, same era.
E. Fischer, J. A. Makowsky, E. V. Ravve, Counting truth assignments of formulas of bounded tree-width or clique-width, Discrete Applied Mathematics 156 (4) (2008) 511–529
2008
Cited alongside, same era.
I. L. Markov, Y. Shi, Simulating quantum computation by contracting tensor networks, SIAM Journal on Computing 38 (3) (2008) 963–981
2008
Cited alongside, same era.
Q.-P. Gu, H. Tamaki, Optimal branch-decomposition of planar graphs in O ( n 3 ) O(n^{3}) time, ACM Transactions on Algorithms (TALG) 4 (3) (2008) 30
2008
Cited alongside, same era.
C. P. Gomes, A. Sabharwal, B. Selman, Model counting, in: Handbook of Satisfiability, IOS Press, 2009, pp. 633–654
2009
J.-M. Lagniez, E. Lonca, P. Marquis, Improving model counting by leveraging definability., in: Proc. of IJCAI, 2016, pp. 751–757
2016
Later among the works it cites.
F. Kjolstad, S. Kamil, S. Chou, D. Lugato, S. Amarasinghe, The tensor algebra compiler, Proc. of PACMPL (2017) 77
2017
Later among the works it cites.
G. Greco, N. Leone, F. Scarcello, G. Terracina, Structural decomposition methods: Key notions and database applications, in: A Comprehensive Guide Through the Italian Database Research Over the Last 25 Years, Springer, 2017, pp. 253–267
2017
Later among the works it cites.
H. Dell, C. Komusiewicz, N. Talmon, M. Weller, The PACE 2017 parameterized algorithms and computational experiments challenge: The second iteration, in: Proc. of IPEC, 2017, pp. 30:1–30:12
2017
Later among the works it cites.
M. Abseher, N. Musliu, S. Woltran, htd- a free, open-source framework for (customized) tree decompositions and beyond, in: Proc. of CPAIOR, 2017, pp. 376–386
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
M. Samer, S. Szeider, Algorithms for propositional model counting, Journal of Discrete Algorithms 8 (1) (2010) 50–64
2010
Cited alongside, same era.
R. Sasak, Comparing 17 graph parameters, Master’s thesis, The University of Bergen (2010)
2010
Cited alongside, same era.
M. Samer, S. Szeider, Constraint satisfaction with bounded treewidth revisited, Journal of Computer and System Sciences 76 (2) (2010) 103–114
2010
Cited alongside, same era.
J. D. Biamonte, S. R. Clark, D. Jaksch, Categorical tensor network states, AIP Advances 1 (4) (2011) 042172
2011
Cited alongside, same era.
I. L. Markov, Y. Shi, Constant-degree graph expansions that preserve treewidth, Algorithmica 59 (4) (2011) 461–470
2011
Cited alongside, same era.
R. Pfeifer, J. Haegeman, F. Verstraete, Faster identification of optimal contraction sequences for tensor networks, Physical Review E 90 (3) (2014) 033315
2014
Cited alongside, same era.
G. Evenbly, R. N. Pfeifer, Improving the efficiency of variational tensor network algorithms, Physical Review B 89 (24) (2014) 245118
2014
Cited alongside, same era.
2017
Later among the works it cites.
H. Tamaki, Positive-instance driven dynamic programming for treewidth, in: Proc. of ESA, 2017, pp. 68:1–68:13
2017
Later among the works it cites.
J.-M. Lagniez, P. Marquis, An improved decision-DNNF compiler, in: Proc. of IJCAI, 2017, pp. 667–673
2017
Later among the works it cites.
J. K. Fichte, M. Hecher, M. Morak, S. Woltran, Answer set solving with bounded treewidth revisited, in: Proc. of LPNMR, Springer, 2017, pp. 132–145
2017
Later among the works it cites.
L. Ying, Tensor network skeletonization, Multiscale Modeling & Simulation 15 (4) (2017) 1423–1447
2017
Later among the works it cites.
M. Hamann, B. Strasser, Graph bisection with pareto optimization, Journal of Experimental Algorithmics (JEA) 23 (1) (2018) 1–2
2018
Later among the works it cites.
L. Dueñas-Osorio, M. Vardi, J. Rojo, Quantum-inspired boolean states for bounding engineering network reliability assessment, Structural Safety 75 (2018) 110–118
2018
Later among the works it cites.
D. J. Harvey, D. R. Wood, The treewidth of line graphs, Journal of Combinatorial Theory, Series B 132 (2018) 157–179
2018
Later among the works it cites.
M. de Oliveira Oliveira, Size-treewidth tradeoffs for circuits computing the element distinctness function, Theory of Computing Systems 62 (1) (2018) 136–161
2018
Later among the works it cites.
J. K. Fichte, M. Hecher, S. Woltran, M. Zisser, Weighted model counting on the GPU by exploiting small treewidth, in: Proc. of ESA, 2018, pp. 28:1–28:16
2018
Later among the works it cites.
R. Orús, Tensor networks for complex quantum systems, Nature Reviews Physics 1 (9) (2019) 538–550
2019
Closest in time.
J. Kim, A. Sukumaran-Rajam, V. Thumma, S. Krishnamoorthy, A. Panyala, L.-N. Pouchet, A. Rountev, P. Sadayappan, A code generator for high-performance tensor contractions on gpus, in: Proc. of CGO, IEEE Press, 2019, pp. 85–95
2019
Closest in time.
NumPy, http://www.numpy.org/ , Accessed: 2019-12-02
2019
Closest in time.
2048
Closest in time.
L. Grasedyck, Hierarchical singular value decomposition of tensors, SIAM Journal on Matrix Analysis and Applications 31 (4) (2010) 2029–2054
2054
Closest in time.