The following pages link to (Q4252030):
Displaying 14 items.
- Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\) (Q412209) (← links)
- On the complexity of inverting integer and polynomial matrices (Q901933) (← links)
- On the computation of the HNF of a module over the ring of integers of a number field (Q1711990) (← links)
- Improved cryptanalysis of a ElGamal cryptosystem based on matrices over group rings (Q2033526) (← links)
- Efficient Gröbner bases computation over principal ideal rings (Q2211184) (← links)
- Processing succinct matrices and vectors (Q2411035) (← links)
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition (Q2437224) (← links)
- Certified dense linear system solving (Q2643521) (← links)
- Cryptanalysis of schemes based on pseudoinverse matrix (Q2825277) (← links)
- Computing isomorphisms between lattices (Q5118858) (← links)
- Hensel-lifting torsion points on Jacobians and Galois representations (Q5216734) (← links)
- Computation of invariants of finite abelian groups (Q5741502) (← links)
- Classical vs quantum satisfiability in linear constraint systems modulo an integer (Q5870684) (← links)
- A classically efficient forgery of MPPK/DS signatures (Q6564013) (← links)
