Pages that link to "Item:Q5120181"
From MaRDI portal
The following pages link to A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations (Q5120181):
Displaying 7 items.
- Polynomial-division-based algorithms for computing linear recurrence relations (Q820938) (← links)
- Guessing Gröbner bases of structured ideals of relations of sequences (Q2066951) (← 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)
- An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations (Q4974030) (← links)
- Fast Algorithm for Border Bases of Artinian Gorenstein Algebras (Q5119958) (← links)
- Algorithms for linearly recurrent sequences of truncated polynomials (Q6666538) (← links)