Pages that link to "Item:Q3452408"
From MaRDI portal
The following pages link to Powers of tensors and fast matrix multiplication (Q3452408):
Displaying 50 items.
- Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model (Q2988839) (← links)
- Acyclic Digraphs (Q3120435) (← links)
- (Q3121527) (← links)
- Complexity of constructing Dixon resultant matrix (Q3174885) (← links)
- The Complexity of Escaping Labyrinths and Enchanted Forests. (Q3301022) (← links)
- Lower bounds for combinatorial algorithms for Boolean matrix multiplication (Q3304119) (← links)
- Enumeration complexity of conjunctive queries with functional dependencies (Q3305356) (← links)
- Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback (Q3386400) (← links)
- Deterministic Truncation of Linear Matroids (Q3448849) (← links)
- Extreme Witnesses and Their Applications (Q3467863) (← links)
- Recursive fast algorithm and the role of the tensor product (Q4034240) (← links)
- Efficient vector and parallel manipulation of tensor products (Q4371084) (← links)
- New applications of the polynomial method: The cap set conjecture and beyond (Q4562036) (← links)
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- Polynomials and the exponent of matrix multiplication (Q4572031) (← links)
- On the evaluation of some sparse polynomials (Q4600715) (← links)
- Revisiting Decomposition by Clique Separators (Q4610181) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
- Computing isomorphisms and embeddings of finite fields (Q4612574) (← links)
- Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product (Q4634027) (← links)
- Nondeterministic quantum communication complexity: the cyclic equality game and iterated matrix multiplication (Q4638074) (← links)
- Conditional hardness for sensitivity problems (Q4638076) (← links)
- (Q4638113) (← links)
- On cap sets and the group-theoretic approach to matrix multiplication (Q4645008) (← links)
- Border Rank Nonadditivity for Higher Order Tensors (Q4986826) (← links)
- Further Limitations of the Known Approaches for Matrix Multiplication (Q4993288) (← links)
- Quasipolynomial representation of transversal matroids with applications in parameterized complexity (Q4993296) (← links)
- Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy (Q4993299) (← links)
- Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs (Q5002719) (← links)
- Logical complexity of induced subgraph isomorphism for certain families of graphs (Q5003303) (← links)
- Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm (Q5009334) (← links)
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions (Q5009620) (← links)
- (Q5009621) (← links)
- Strong Collapse for Persistence (Q5009636) (← links)
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785) (← links)
- Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication (Q5020726) (← links)
- Universal points in the asymptotic spectrum of tensors (Q5039465) (← links)
- (Q5053318) (← links)
- (Q5075809) (← links)
- Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps (Q5088658) (← links)
- Hamming Distance Completeness (Q5088904) (← links)
- Computing Persistent Homology of Flag Complexes via Strong Collapses (Q5088987) (← links)
- (Q5089178) (← links)
- (Q5090373) (← links)
- (Q5090377) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- (Q5091007) (← links)
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q5091051) (← links)
- (Q5091074) (← links)
