Tensor network complexity of multilinear maps
From MaRDI portal
Recommendations
Cites work
- A complete dichotomy rises from the capture of vanishing signatures
- A faster subquadratic algorithm for finding outlier correlations
- A new algorithm for optimal 2-constraint satisfaction and its implications
- A practical introduction to tensor networks: Matrix product states and projected entangled pair states
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Balanced families of perfect hash functions and their applications
- Computational Complexity
- Computational complexity of Holant problems
- Counting \(H-\)colorings of partial \(k-\)trees
- Counting Paths and Packings in Halves
- Detecting and counting small pattern graphs
- Diagrams, tensors and geometric reasoning
- Duality of graphical models and tensor networks
- Dynamic Programming and Fast Matrix Multiplication
- Faster algorithms for finding and counting subgraphs
- Faster algorithms on branch and clique decompositions
- Faster all-pairs shortest paths via circuit complexity
- Finding a Minimum Circuit in a Graph
- Finding and counting given length cycles
- Finding and counting small induced subgraphs efficiently
- Finding four-node subgraphs in triangle time
- Finding, minimizing, and counting weighted subgraphs
- Fourier meets M\"{o}bius: fast subset convolution
- Gaussian elimination is not optimal
- Holographic Algorithms
- Homomorphisms are a good basis for counting small subgraphs
- scientific article; zbMATH DE number 5968745 (Why is no real title available?)
- scientific article; zbMATH DE number 3910446 (Why is no real title available?)
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- scientific article; zbMATH DE number 53687 (Why is no real title available?)
- scientific article; zbMATH DE number 1775055 (Why is no real title available?)
- scientific article; zbMATH DE number 3344105 (Why is no real title available?)
- If the current clique algorithms are optimal, so is Valiant's parser
- INVOLUTORY HOPF ALGEBRAS AND 3-MANIFOLD INVARIANTS
- Lower bounds on the size of semidefinite programming relaxations
- Models of greedy algorithms for graph problems
- Multiplying matrices faster than coppersmith-winograd
- On computing the determinant in small parallel time using a small number of processors
- On the complexity of k-SAT
- On the complexity of fixed parameter clique and dominating set
- On the geometry of tensor network states
- On traces of tensor representations of diagrams
- Paw-free graphs
- Powers of tensors and fast matrix multiplication
- Probabilistic graphical models.
- Quantum computation and the evaluation of tensor networks
- Set partitioning via inclusion-exclusion
- Tensor Decompositions and Applications
- Tensor-rank and lower bounds for arithmetic formulas
- The arithmetic complexity of tensor contraction
- The complexity of computing the permanent
- The complexity of tensor calculus
- The complexity of tensor circuit evaluation
- The Travelling Salesman Problem in Bounded Degree Graphs
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Tight hardness for shortest cycles and paths in sparse graphs
- Toward a model for backtracking and dynamic programming
- Triangular Factorization and Inversion by Fast Matrix Multiplication
- Which problems have strongly exponential complexity?
Cited in
(4)
This page was built for publication: Tensor network complexity of multilinear maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090377)
