Pages that link to "Item:Q2536323"
From MaRDI portal
The following pages link to Gaussian elimination is not optimal (Q2536323):
Displaying 50 items.
- The Faddeev-LeVerrier algorithm and the Pfaffian (Q820990) (← links)
- Speeding up HMM decoding and training by exploiting sequence repetitions (Q834590) (← links)
- An algebraic attack on the improved summation generator with 2-bit memory (Q834989) (← links)
- Efficient enumeration of words in regular languages (Q840765) (← links)
- Fast verified solutions of linear systems (Q849174) (← links)
- Fast matrix multiplication is stable (Q879926) (← links)
- On the approximate bilinear complexity of matrix multiplication (Q891131) (← links)
- Average-case complexity of the min-sum matrix product problem (Q897863) (← links)
- Parallelism and fast solution of linear systems (Q911213) (← links)
- Replacing unification by constraint satisfaction to improve logic program expressiveness (Q912656) (← links)
- A tensor product formulation of Strassen's matrix multiplication algorithm (Q918132) (← links)
- Finding large 3-free sets. I. The small \(n\) case (Q927879) (← links)
- Two dimensional aggregation procedure: An alternative to the matrix algebraic algorithm (Q928164) (← links)
- Computing the Fréchet distance between simple polygons (Q934016) (← links)
- A fast cellular method of matrix multiplication (Q946778) (← links)
- Optimal Karatsuba-like formulae for certain bilinear forms in GF(2) (Q947669) (← links)
- Solving structured linear systems with large displacement rank (Q954988) (← links)
- Decision problem for shuffled genes (Q958310) (← links)
- Fast multiplication of matrices over a finitely generated semiring (Q963453) (← links)
- The Mailman algorithm: a note on matrix-vector multiplication (Q976066) (← links)
- Efficient algorithms for clique problems (Q976087) (← links)
- Newton's method and FFT trading (Q979146) (← links)
- Solving path problems on the GPU (Q991105) (← links)
- All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time (Q1001904) (← links)
- Generalized matrix inversion is not harder than matrix multiplication (Q1026453) (← links)
- A mixed cellular method of matrix multiplication (Q1040343) (← links)
- On-line computation of transitive closures of graphs (Q1051432) (← links)
- Multiplicative complexity and algebraic structure (Q1053459) (← links)
- Fast algorithms for the characteristic polynomial (Q1058849) (← links)
- Storing matrices on disk for efficient row and column retrieval (Q1064062) (← links)
- Improved lower bounds for some matrix multiplication problems (Q1068534) (← links)
- On transformations of algorithms to multiply 2\(\times 2\) matrices (Q1069698) (← links)
- Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés (Q1073816) (← links)
- An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs (Q1075771) (← links)
- Gaussian elimination is optimal for solving linear equations in dimension two (Q1076478) (← links)
- A polynomial time bound for Howard's policy improvement algorithm (Q1079511) (← links)
- A very personal reminiscence on the problem of computational complexity (Q1091818) (← links)
- On the computational complexity of the general discrete Fourier transform (Q1094136) (← links)
- Discrete logarithms in \(\mathrm{GF}(p)\) (Q1094455) (← links)
- The trace invariant and matrix inversion (Q1105373) (← links)
- An improved parallel algorithm that computes the BFS numbering of a directed graph (Q1111392) (← links)
- The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms (Q1121670) (← links)
- Matrix structures in parallel matrix computations (Q1122309) (← links)
- The bulk-synchronous parallel random access machine (Q1128714) (← links)
- On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping (Q1131837) (← links)
- On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication (Q1131838) (← links)
- Switching functions whose monotone complexity is nearly quadratic (Q1133519) (← links)
- Stability of fast algorithms for matrix multiplication (Q1138347) (← links)
- Bounds on the ranks of some 3-tensors (Q1138616) (← links)
- Negation can be exponentially powerful (Q1143790) (← links)
