NP-Hardness of Tensor Network Contraction Ordering
We study the optimal order (or sequence) of contracting a tensor network with a minimal
computational cost. We conclude 2 different versions of this optimal sequence: that minimize …
computational cost. We conclude 2 different versions of this optimal sequence: that minimize …