Pages that link to "Item:Q1421221"
From MaRDI portal
The following pages link to Computing the sign or the value of the determinant of an integer matrix, a complexity survey. (Q1421221):
Displaying 10 items.
- Faster geometric algorithms via dynamic determinant computation (Q283878) (← links)
- Evaluating signs of determinants using single-precision arithmetic (Q675307) (← links)
- Some inequalities related to the Seysen measure of a lattice (Q710880) (← links)
- Complexity measures of sign matrices (Q949752) (← links)
- Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme (Q1045913) (← links)
- On the extension of Sarrus' rule to \(n \times n\) (\(n > 3\)) matrices: development of new method for the computation of the determinant of \(4 \times 4\) matrix (Q1653536) (← links)
- On the computation of the HNF of a module over the ring of integers of a number field (Q1711990) (← links)
- The shifted number system for fast linear algebra on integer matrices (Q2387425) (← links)
- Rational univariate reduction via toric resultants (Q2517810) (← links)
- Certification of numerical computation of the sign of the determinant of a matrix (Q5940606) (← links)
