The following pages link to Sparse FGLM algorithms (Q1711988):
Displaying 18 items.
- Parametric FGLM algorithm (Q512366) (← links)
- Polynomial-division-based algorithms for computing linear recurrence relations (Q820938) (← links)
- Implementation of the FGLM algorithm and finding roots of polynomial involutive systems (Q1429034) (← links)
- Fast computation of generic bivariate resultants (Q1996880) (← links)
- Guessing Gröbner bases of structured ideals of relations of sequences (Q2066951) (← links)
- Symbolic computation for the qualitative theory of differential equations (Q2080988) (← links)
- Gröbner bases and critical values: the asymptotic combinatorics of determinantal systems (Q2132458) (← links)
- In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants (Q2188986) (← links)
- Computing syzygies in finite dimension using fast linear algebra (Q2192678) (← links)
- Chordal graphs in triangular decomposition in top-down style (Q2200301) (← links)
- Block-Krylov techniques in the context of sparse-FGLM algorithms (Q2284956) (← links)
- Symmetry in multivariate ideal interpolation (Q2674003) (← links)
- Exact algorithms for linear matrix inequalities (Q2834563) (← links)
- Modular matrix multiplication on GPU for polynomial system solving (Q6536546) (← links)
- Bivariate polynomial reduction and elimination ideal over finite fields (Q6615408) (← links)
- The algebraic FreeLunch: efficient Gröbner basis attacks against arithmetization-oriented primitives (Q6652914) (← links)
- msolve. A library for solving polynomial systems (Q6666519) (← links)
- Computing the dimension of real algebraic sets (Q6666545) (← links)
