Fetching the paper…
Reading the bibliography…
Tensor networks have been an important concept and technique in many research areas, such as quantum computation and machine learning.
A separator theorem for planar graphs
Richard J Lipton and Robert Endre Tarjan · 1979
Earlier work this paper cites.
Edge separators for planar graphs and their applications
Krzystof Diks, Hristo N. Djidjev, Ondrej Sykora, and Imrich” Vrto · 1988
Earlier work this paper cites.
Towards a standardized notation and terminology in multiway analysis
Henk Kiers · 2000
Earlier work this paper cites.
On the complexity of k-sat
Russell Impagliazzo and Ramamohan Paturi · 2001
Earlier work this paper cites.
Which problems have strongly exponential complexity?
Russell Impagliazzo, Ramamohan Paturi, and Francis Zane · 2001
Earlier work this paper cites.
Elements of Information Theory, 2nd Edition
Thomas M. Cover and Joy A. Thomas · 2006
Earlier work this paper cites.
Symmetric tensors and symmetric tensor rank
Pierre Comon, Gene Golub, Lek-Heng Lim, and Bernard Mourrain · 2008
Earlier work this paper cites.
Simulating quantum computation by contracting tensor networks
Igor L. Markov and Yaoyun Shi · 2008
Earlier work this paper cites.
Tensor decompositions and applications
Tamara Kolda and Brett Bader · 2009
Earlier work this paper cites.
Exponential time complexity of the permanent and the tutte polynomial
Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, and Martin Wahlen · 2014
Earlier work this paper cites.
Tensor network renormalization
Glen Evenbly and Guifre Vidal · 2015
Cited alongside, same era.
Holant Problems
Jin Yi Cai, Heng Guo, and Tyson Williams · 2016
Cited alongside, same era.
Tensor networks for dimensionality reduction and large-scale optimization: Part 1 low-rank tensor decompositions
Andrzej Cichocki, Namgil Lee, Ivan Oseledets, Anh-Huy Phan, Qibin Zhao, and Danilo P. Mandic · 2016
Cited alongside, same era.
k-way hypergraph partitioning via n-level recursive bisection
Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders, and Christian Schulz · 2016
Cited alongside, same era.
Engineering a direct k-way Hypergraph Partitioning Algorithm
Yaroslav Akhremtsev, Tobias Heuer, Peter Sanders, and Sebastian Schlag · 2017
Cited alongside, same era.
A complete dichotomy for complex-valued holantˆc
The exponential-time complexity of counting (quantum) graph homomorphisms
Hubie Chen, Radu Curticapean, and Holger Dell · 2019
Later among the works it cites.
Fast counting with tensor networks
Stefanos Kourtis, Claudio Chamon, Eduardo R. Mucciolo, and Andrei E. Ruckenstein · 2019
Later among the works it cites.
Quantum entanglement in deep learning architectures
Yoav Levine, Or Sharir, Nadav Cohen, and Amnon Shashua · 2019
Later among the works it cites.
Benjamin Villalonga, Sergio Boixo, Bron Nelson, Christopher Henze, Eleanor Rieffel, Rupak Biswas, and Salvatore Mandrà · 2019
Later among the works it cites.
Dichotomy for holant* problems of boolean domain
Jin-Yi Cai, Pinyan Lu, and Mingji Xia · 2020
Closest in time.
A dichotomy for real boolean holant problems
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Miriam Backens · 2018
Cited alongside, same era.
Classical simulation of intermediate-size quantum circuits
Jianxin Chen, Fang Zhang, Mingcheng Chen, Cupjin Huang, Michael Newman, and Yaoyun Shi · 2018
Cited alongside, same era.
Block interpolation: A framework for tight exponential-time counting complexity
Radu Curticapean · 2018
Cited alongside, same era.
The complexity of boolean holant problems with nonnegative weights
Jiabao Lin and Hanpin Wang · 2018
Cited alongside, same era.
Fine-grained dichotomies for the tutte plane and boolean #csp
Cornelius Brand, Holger Dell, and Marc Roth · 2019
Cited alongside, same era.
Shuai Shao and Jin-Yi Cai · 2020
Closest in time.
Hyper-optimized tensor network contraction
Johnnie Gray and Stefanos Kourtis · 2021
Closest in time.
Accelerating tensor contraction products via tensor-train decomposition [tips & tricks]
Ilya Kisil, Giuseppe G. Calvi, Kriton Konstantinidis, Yao Lei Xu, and Danilo P. Mandic · 2022
Closest in time.
The exponential-time complexity of the complex weighted #csp
Ying Liu · 2022
Closest in time.