The following pages link to (Q4038737):
Displayed 29 items.
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation (Q540327) (← links)
- On efficient sparse integer matrix Smith normal form computations (Q597114) (← links)
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization (Q660795) (← links)
- Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation (Q898244) (← links)
- Solving structured linear systems with large displacement rank (Q954988) (← links)
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting (Q964741) (← links)
- Techniques for exploiting structure in matrix formulae of the sparse resultant (Q1127958) (← links)
- A new efficient algorithm for computing Gröbner bases \((F_4)\) (Q1295781) (← links)
- Efficient matrix preconditioners for black box linear algebra (Q1348088) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- Algebraic and numerical techniques for the computation of matrix determinants (Q1368466) (← links)
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices (Q1600039) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- A note on the factorization method of Niederreiter (Q1779329) (← links)
- Superfast algorithms for Cauchy-like matrix computations and extensions (Q1978119) (← links)
- Multiparty cardinality testing for threshold private intersection (Q2061947) (← links)
- A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals (Q2229288) (← links)
- Degeneracy loci and polynomial equation solving (Q2340506) (← links)
- Relating \(p\)-adic eigenvalues and the local Smith normal form (Q2350014) (← links)
- Numerically safe Gaussian elimination with no pivoting (Q2359570) (← links)
- Lifting and recombination techniques for absolute factorization (Q2371310) (← links)
- Improved dense multivariate polynomial factorization algorithms (Q2457431) (← links)
- Efficient parallel factorization and solution of structured and unstructured linear systems (Q2486566) (← links)
- Fast computation of the rank profile matrix and the generalized Bruhat decomposition (Q2628319) (← links)
- Certified sparse linear system solving (Q2643567) (← links)
- On Fast and Provably Secure Message Authentication Based on Universal Hashing (Q3452360) (← links)
- Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work (Q5232110) (← links)
- On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms (Q5348227) (← links)
- Elimination ideal and bivariate resultant over finite fields (Q6081978) (← links)