Pages that link to "Item:Q3452408"

The following pages link to Powers of tensors and fast matrix multiplication (Q3452408):

Displaying 50 items.

• (Q5091155) (← links)
• Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. (Q5091156) (← links)
• (Q5091161) (← links)
• (Q5091170) (← links)
• Faster Algorithms for All Pairs Non-Decreasing Paths Problem (Q5091202) (← links)
• Limits on the Universal method for matrix multiplication (Q5091763) (← links)
• (Q5091778) (← links)
• (Q5092446) (← links)
• (Q5092486) (← links)
• Reverse-Safe Text Indexing (Q5102053) (← links)
• A fast randomized geometric algorithm for computing Riemann-Roch spaces (Q5113675) (← links)
• (Q5115792) (← links)
• Hanani-Tutte for approximating maps of graphs (Q5115807) (← links)
• Tropical Geometry (Q5118414) (← links)
• Bounds and algorithms for graph trusses (Q5119376) (← links)
• (Q5121898) (← links)
• (Q5121900) (← links)
• Small normalized Boolean circuits for semi-disjoint bilinear forms require logarithmic conjunction-depth (Q5121914) (← links)
• Nearly Work-Efficient Parallel Algorithm for Digraph Reachability (Q5129233) (← links)
• Dominance Product and High-Dimensional Closest Pair under L_infty (Q5136258) (← links)
• On the index of convergence of a class of Boolean matrices with structural properties (Q5157961) (← links)
• (Q5158495) (← links)
• Barriers for fast matrix multiplication from irreversibility (Q5158496) (← links)
• A Rank 18 Waring Decomposition of <i>sM</i>_〈3〉 with 432 Symmetries (Q5163157) (← links)
• Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic (Q5203969) (← links)
• On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms (Q5348227) (← links)
• On Regularity Lemmas and their Algorithmic Applications (Q5366957) (← links)
• Border Rank Is Not Multiplicative under the Tensor Product (Q5382574) (← links)
• (Q5857015) (← links)
• Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, <i>b</i>-matching, and Unweighted <i>f</i>-factors (Q5858644) (← links)
• Algorithms for Weighted Matching Generalizations II: <i>f</i>-factors and the Special Case of Shortest Paths (Q5858647) (← links)
• Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon (Q5859625) (← links)
• Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (Q5860479) (← links)
• Elastic-Degenerate String Matching via Fast Matrix Multiplication (Q5864665) (← links)
• Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time. (Q5874551) (← links)
• (Q5875703) (← links)
• Strong collapse and persistent homology (Q5880377) (← links)
• Planar and Toroidal Morphs Made Easier (Q5886038) (← links)
• The descriptive complexity of subgraph isomorphism without numerics (Q5919541) (← links)
• Convexity-increasing morphs of planar graphs (Q5919691) (← links)
• Realization problems on reachability sequences (Q5925515) (← links)
• Rare siblings speed-up deterministic detection and counting of small pattern graphs (Q5925690) (← links)
• Meet-in-the-middle attack with splice-and-cut technique and a general automatic framework (Q6048704) (← links)
• Skew-polynomial-sparse matrix multiplication (Q6051113) (← links)
• A faster interior-point method for sum-of-squares optimization (Q6053475) (← links)
• Triangle‐free equimatchable graphs (Q6057652) (← links)
• (Q6065422) (← links)
• Space Hardness of Solving Structured Linear Systems. (Q6065465) (← links)
• A modeling and computational study of the frustration index in signed networks (Q6068535) (← links)
• Linear‐time algorithms for eliminating claws in graphs (Q6082274) (← links)