Pages that link to "Item:Q2643521"
From MaRDI portal
The following pages link to Certified dense linear system solving (Q2643521):
Displaying 19 items.
- Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\) (Q412209) (← links)
- Geometrical regular languages and linear Diophantine equations: the strongly connected case (Q443737) (← links)
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization (Q660795) (← links)
- On the complexity of inverting integer and polynomial matrices (Q901933) (← links)
- A \(p\)-adic algorithm for computing the inverse of integer matrices (Q1004026) (← links)
- On lattice reduction for polynomial matrices (Q1401903) (← links)
- On computation of the greatest common divisor of several polynomials over a finite field. (Q1414018) (← links)
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey. (Q1421221) (← links)
- High-order lifting and integrality certification (Q1878491) (← links)
- Verification protocols with sub-linear communication for polynomial matrix operations (Q1994891) (← links)
- Package of procedures for inverting matrices whose entries are linear difference operators (Q2217188) (← links)
- On the solvability of a system of linear equations over the domain of principal ideals (Q2260829) (← links)
- The shifted number system for fast linear algebra on integer matrices (Q2387425) (← links)
- Certified dense linear system solving (Q2643521) (← links)
- Certified sparse linear system solving (Q2643567) (← links)
- Computing the Mazur and Swinnerton-Dyer critical subgroup of elliptic curves (Q2814449) (← links)
- On the Differential and Full Algebraic Complexities of Operator Matrices Transformations (Q2829987) (← links)
- Geometrical Regular Languages and Linear Diophantine Equations (Q5200085) (← links)
- On the probability of generating a primitive matrix (Q6595060) (← links)
