scientific article; zbMATH DE number 7559050
From MaRDI portal
Publication:5090377
DOI10.4230/LIPIcs.ITCS.2019.7MaRDI QIDQ5090377
Petteri Kaski, Per Austrin, Kaie Kubjas
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1712.09630
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Tensor Decompositions and Applications
- The arithmetic complexity of tensor contraction
- Finding and counting small induced subgraphs efficiently
- A practical introduction to tensor networks: Matrix product states and projected entangled pair states
- Toward a model for backtracking and dynamic programming
- Faster algorithms for finding and counting subgraphs
- The complexity of computing the permanent
- Finding and counting given length cycles
- On the complexity of fixed parameter clique and dominating set
- On computing the determinant in small parallel time using a small number of processors
- Models of greedy algorithms for graph problems
- Paw-free graphs
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- The complexity of tensor calculus
- Counting \(H-\)colorings of partial \(k-\)trees
- Which problems have strongly exponential complexity?
- On traces of tensor representations of diagrams
- Diagrams, tensors and geometric reasoning
- The complexity of tensor circuit evaluation
- Gaussian elimination is not optimal
- A new algorithm for optimal 2-constraint satisfaction and its implications
- A Complete Dichotomy Rises from the Capture of Vanishing Signatures
- Finding, Minimizing, and Counting Weighted Subgraphs
- Balanced families of perfect hash functions and their applications
- Lower Bounds on the Size of Semidefinite Programming Relaxations
- Computational Complexity of Holant Problems
- On the geometry of tensor network states
- INVOLUTORY HOPF ALGEBRAS AND 3-MANIFOLD INVARIANTS
- Powers of tensors and fast matrix multiplication
- The Travelling Salesman Problem in Bounded Degree Graphs
- Holographic Algorithms
- Fourier meets M\"{o}bius: fast subset convolution
- Set Partitioning via Inclusion-Exclusion
- Faster Algorithms on Branch and Clique Decompositions
- Counting Paths and Packings in Halves
- Finding a Minimum Circuit in a Graph
- Triangular Factorization and Inversion by Fast Matrix Multiplication
- A Faster Subquadratic Algorithm for Finding Outlier Correlations
- Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser
- Homomorphisms are a good basis for counting small subgraphs
- Duality of graphical models and tensor networks
- Faster all-pairs shortest paths via circuit complexity
- Computational Complexity
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Finding Four-Node Subgraphs in Triangle Time
- Quantum Computation and the Evaluation of Tensor Networks
- Tensor-Rank and Lower Bounds for Arithmetic Formulas
- Multiplying matrices faster than coppersmith-winograd
- Dynamic Programming and Fast Matrix Multiplication
- Detecting and Counting Small Pattern Graphs
- On the complexity of \(k\)-SAT
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
