Pages that link to "Item:Q2536323"
From MaRDI portal
The following pages link to Gaussian elimination is not optimal (Q2536323):
Displaying 50 items.
- On the complexity of skew arithmetic (Q260085) (← links)
- Fast algorithms for the basic operation of cellular methods of linear algebra (Q269130) (← links)
- A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic (Q285264) (← links)
- Cancellation is exponentially powerful for computing the determinant (Q287054) (← links)
- Parity OBDDs cannot be handled efficiently enough (Q293348) (← links)
- On the nuclear norm and the singular value decomposition of tensors (Q300892) (← links)
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← links)
- A modified wright-Fisher model that incorporates \(N_e\): a variant of the standard model with increased biological realism and reduced computational complexity (Q305981) (← links)
- Ciphertext-only attack on \(d\times d\) Hill in \(O(d 13^d)\) (Q344527) (← links)
- On the arithmetic complexity of Strassen-like matrix multiplications (Q346560) (← links)
- On sunflowers and matrix multiplication (Q354642) (← links)
- Morse theory for filtrations and efficient computation of persistent homology (Q368767) (← links)
- Algebraic attacks on a class of stream ciphers with unknown output function (Q369422) (← links)
- Parsing by matrix multiplication generalized to Boolean grammars (Q385966) (← links)
- The rank of \(n \times n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\) (Q389730) (← links)
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
- Optimal algorithms of Gram-Schmidt type (Q393367) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- On the arithmetic Walsh coefficients of Boolean functions (Q398933) (← links)
- Sets of nonnegative matrices without positive products (Q426069) (← links)
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method (Q432769) (← links)
- Positivity preserving discretization of time dependent semiconductor drift-diffusion equations (Q450888) (← links)
- New fast hybrid matrix multiplication algorithms (Q464981) (← links)
- New cellular methods for matrix multiplication (Q465910) (← links)
- A unified cellular method for matrix multiplication (Q465980) (← links)
- An all-pairs shortest path algorithm for bipartite graphs (Q469055) (← links)
- Comments to my works, written by myself (Q483174) (← links)
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices (Q483185) (← links)
- Neighborhood-based uncertainty generation in social networks (Q489696) (← links)
- The Hackbusch conjecture on tensor formats (Q496420) (← links)
- Numerical CP decomposition of some difficult tensors (Q508007) (← links)
- On minimum witnesses for Boolean matrix multiplication (Q517804) (← links)
- Optimization techniques for small matrix multiplication (Q533859) (← links)
- Using Strassen's algorithm to accelerate the solution of linear systems (Q547473) (← links)
- Bayesian robot system identification with input and output noise (Q553249) (← links)
- Generating fast Fourier transforms of solvable groups (Q597054) (← links)
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication (Q598219) (← links)
- The complexity of computing the permanent (Q600247) (← links)
- Optimal sparse matrix dense vector multiplication in the I/O-model (Q613122) (← links)
- On groups of hypersubstitutions (Q616120) (← links)
- Constructive homomorphisms for classical groups. (Q629346) (← links)
- On the additive complexity of 2 \(\times 2\) matrix multiplication (Q672835) (← links)
- The Fork95 programming language: Design, implementation, application. (Q676263) (← links)
- The double pivot simplex method (Q684156) (← links)
- Some computational problems in linear algebra as hard as matrix multiplication (Q685718) (← links)
- Residual methods for the large-scale matrix \(p\)th root and some related problems (Q711300) (← links)
- Information-based complexity: New questions for mathematicians (Q751814) (← links)
- A parallel search algorithm for directed acyclic graphs (Q795509) (← links)
- The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations (Q800727) (← links)
- Minimal fill in O(\(n^{2.69}\)) time (Q819828) (← links)
