Pages that link to "Item:Q2192678"
From MaRDI portal
The following pages link to Computing syzygies in finite dimension using fast linear algebra (Q2192678):
Displaying 12 items.
- On syzygy modules over Laurent polynomial rings (Q779968) (← links)
- Refined algorithms to compute syzygies (Q898264) (← links)
- Algorithm for computing \(\mu\)-bases of univariate polynomials (Q1712001) (← links)
- Guessing Gröbner bases of structured ideals of relations of sequences (Q2066951) (← links)
- Fast amortized multi-point evaluation (Q2238846) (← links)
- Computing syzygies over \(V [X_1, \ldots, X_k]\), \(V\) a valuation domain (Q2254141) (← links)
- Un Algorithme pour le Calcul des Syzygies sur<b>V</b>[<i>X</i>] dans le cas où<b>V</b>est un Domaine de Valuation (Q2876243) (← links)
- A Koszul decomposition for the computation of linear syzygies (Q5929732) (← links)
- An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases (Q6650574) (← links)
- The algebraic FreeLunch: efficient Gröbner basis attacks against arithmetization-oriented primitives (Q6652914) (← links)
- Amortized bivariate multi-point evaluation (Q6666534) (← links)
- Algorithms for linearly recurrent sequences of truncated polynomials (Q6666538) (← links)
