Pages that link to "Item:Q2066951"
From MaRDI portal
The following pages link to Guessing Gröbner bases of structured ideals of relations of sequences (Q2066951):
Displaying 4 items.
- Polynomial-division-based algorithms for computing linear recurrence relations (Q820938) (← links)
- In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants (Q2188986) (← links)
- Computing the algebraic relations of \(C\)-finite sequences and multisequences (Q2517807) (← links)
- A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations (Q5120181) (← links)