Parameterization of tensor network contraction
From MaRDI portal
Publication:5089157
Recommendations
Cites work
- A linear time algorithm for finding tree-decompositions of small treewidth
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Call routing and the ratcatcher
- Complexity-theoretic foundations of quantum supremacy experiments
- Constructive linear time algorithms for branchwidth
- Derivation of algorithms for cutwidth and related graph layout parameters
- Graph minors. X: Obstructions to tree-decomposition
- Graph theory
- scientific article; zbMATH DE number 219228 (Why is no real title available?)
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Minimal congestion trees
- On embedding graphs in trees
- Parameterized algorithms
- Quantum computation and the evaluation of tensor networks
- Simulating Quantum Computation by Contracting Tensor Networks
- Tensor network contractions for \#SAT
- The treewidth of line graphs
- Tour merging via branch-decomposition
Cited in
(3)
This page was built for publication: Parameterization of tensor network contraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089157)