Pages that link to "Item:Q4402461"

The following pages link to Triangular Factorization and Inversion by Fast Matrix Multiplication (Q4402461):

Displaying 50 items.

• A fast algorithm to construct a representation for transversal matroids (Q263073) (← links)
• Faster geometric algorithms via dynamic determinant computation (Q283878) (← links)
• On efficient calculations for Bayesian variable selection (Q434881) (← links)
• Efficiently hex-meshing things with topology (Q471135) (← links)
• Some computational problems in linear algebra as hard as matrix multiplication (Q685718) (← links)
• Fast dynamic transitive closure with lookahead (Q848959) (← links)
• Alternating paths along axis-parallel segments (Q882782) (← links)
• Structural control of single-input rank one bilinear systems (Q899250) (← links)
• Upper bounds on the complexity of solving systems of linear equations (Q1057647) (← links)
• Fast algorithms for the characteristic polynomial (Q1058849) (← links)
• Computational methods of linear algebra (Q1148099) (← links)
• On the implementation of Strassen's fast multiplication algorithm (Q1219685) (← links)
• Computing the sign or the value of the determinant of an integer matrix, a complexity survey. (Q1421221) (← links)
• Efficient decomposition of separable algebras. (Q1432890) (← links)
• Essentially optimal computation of the inverse of generic polynomial matrices (Q1763425) (← links)
• A segregated approach for modeling the electrochemistry in the 3-D microstructure of li-ion batteries and its acceleration using block preconditioners (Q1995987) (← links)
• Representative families for matroid intersections, with applications to location, packing, and covering problems (Q2028091) (← links)
• An algebraic attack on rank metric code-based cryptosystems (Q2055648) (← links)
• Generalized persistence algorithm for decomposing multiparameter persistence modules (Q2082448) (← links)
• An adaptive conservative moving mesh method (Q2090702) (← links)
• Low-rank traffic matrix completion with marginal information (Q2122050) (← links)
• Designing efficient dyadic operations for cryptographic applications (Q2191206) (← links)
• Deterministic computation of the characteristic polynomial in the time of matrix multiplication (Q2238844) (← links)
• Maximum matchings in planar graphs via Gaussian elimination (Q2369872) (← links)
• Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix (Q2402419) (← links)
• Rank-profile revealing Gaussian elimination and the CUP matrix decomposition (Q2437224) (← links)
• On the complexity of matrix reduction over finite fields (Q2467342) (← links)
• Algebraic Algorithms for Linear Matroid Parity Problems (Q2799476) (← links)
• Fast Generalized Bruhat Decomposition (Q3589076) (← links)
• Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
• Adjoint Code Design Patterns (Q4960944) (← links)
• Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm (Q5009334) (← links)
• (Q5009600) (← links)
• Approximation of insurance liability contracts using radial basis functions (Q5031711) (← links)
• Observability and reconstructibility of bounded cellular automata (Q5046862) (← links)
• (Q5061838) (← links)
• (Q5090377) (← links)
• (Q5092446) (← links)
• Reverse-Safe Text Indexing (Q5102053) (← links)
• A fast randomized geometric algorithm for computing Riemann-Roch spaces (Q5113675) (← links)
• Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic (Q5203969) (← links)
• Fast Hierarchical Solvers For Sparse Matrices Using Extended Sparsification and Low-Rank Approximation (Q5738178) (← links)
• Parameterized Pre-Coloring Extension and List Coloring Problems (Q5857010) (← links)
• Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, <i>b</i>-matching, and Unweighted <i>f</i>-factors (Q5858644) (← links)
• A Gröbner free alternative for polynomial system solving (Q5938584) (← links)
• Maximum matchings in geometric intersection graphs (Q6050213) (← links)
• Skew-polynomial-sparse matrix multiplication (Q6051113) (← links)
• A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (Q6126717) (← links)
• Reduced-order modeling of neutron transport eigenvalue problems separated in energy by proper generalized decomposition (Q6147105) (← links)
• Efficient Kirszbraun extension with applications to regression (Q6608045) (← links)