Pages that link to "Item:Q3452408"

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

Displaying 50 items.

• Improved distance sensitivity oracles with subcubic preprocessing time (Q2237898) (← links)
• K-plex cover pooling for graph neural networks (Q2238356) (← links)
• Algorithms and conditional lower bounds for planning problems (Q2238604) (← links)
• Deterministic computation of the characteristic polynomial in the time of matrix multiplication (Q2238844) (← links)
• Fast amortized multi-point evaluation (Q2238846) (← links)
• Approximating the minimum cycle mean (Q2253203) (← links)
• Improved method for finding optimal formulas for bilinear maps in a finite field (Q2272384) (← links)
• Strassen's \(2 \times 2\) matrix multiplication algorithm: a conceptual perspective (Q2280138) (← links)
• The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
• Fast computation of approximant bases in canonical form (Q2284957) (← links)
• Sparse matrix multiplication and triangle listing in the congested clique model (Q2290622) (← links)
• Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time (Q2309471) (← links)
• Exact and approximation algorithms for weighted matroid intersection (Q2316615) (← links)
• Improved distance queries and cycle counting by Frobenius normal form (Q2321929) (← links)
• A fourth-order method for computing the sign function of a matrix with application in the Yang-Baxter-like matrix equation (Q2322453) (← links)
• Grothendieck constant is norm of Strassen matrix multiplication tensor (Q2334621) (← links)
• On hardness of several string indexing problems (Q2342674) (← links)
• On the complexity of the \(F_5\) Gröbner basis algorithm (Q2343240) (← links)
• A note on the gap between rank and border rank (Q2396706) (← links)
• Abelian tensors (Q2398420) (← links)
• Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
• Efficiently correcting matrix products (Q2408920) (← links)
• Time and space efficient generators for quasiseparable matrices (Q2409018) (← links)
• Data-driven model reduction by moment matching for linear and nonlinear systems (Q2409366) (← links)
• Maximum matching width: new characterizations and a fast algorithm for dominating set (Q2413973) (← links)
• Solving the clique cover problem on (bull, \(C_4\))-free graphs (Q2414459) (← links)
• Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back (Q2415385) (← links)
• Tensor surgery and tensor rank (Q2422765) (← links)
• Asymptotic tensor rank of graph tensors: beyond matrix multiplication (Q2422766) (← links)
• Computing minimal interpolation bases (Q2628323) (← links)
• A note on the complexity of computing the number of reachable vertices in a digraph (Q2629773) (← links)
• Faster sparse multivariate polynomial interpolation of straight-line programs (Q2635066) (← links)
• On the complexity exponent of polynomial system solving (Q2658549) (← links)
• Complexity bounds for approximately solving discounted MDPs by value iterations (Q2661516) (← links)
• Lower bounds for Boolean circuits of bounded negation width (Q2672949) (← links)
• Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications (Q2674000) (← links)
• Some fast algorithms multiplying a matrix by its adjoint (Q2674011) (← links)
• Improved bounds for rectangular monotone min-plus product and applications (Q2681403) (← links)
• Retracted: Invertible matrices over some quotient rings: identification, generation, and analysis (Q2685509) (← links)
• In search of hyperpaths (Q2690124) (← links)
• Packing \(A\)-paths in group-labelled graphs via linear matroid parity (Q2797090) (← links)
• Cryptanalysis of Feistel Networks with Secret Round Functions (Q2807198) (← links)
• Improving the numerical stability of fast matrix multiplication (Q2827068) (← links)
• Upgrading subgroup triple-product-property triples (Q2828201) (← links)
• Efficiently Correcting Matrix Products (Q2942613) (← links)
• 3D Rectangulations and Geometric Matrix Multiplication (Q2942614) (← links)
• Quantum Complexity of Boolean Matrix Multiplication and Related Problems (Q2944887) (← links)
• A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques (Q2980911) (← links)
• The Complexity of Perfect Packings in Dense Graphs (Q2988829) (← links)
• Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution (Q2988838) (← links)