A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations-Reference-Cited by-同舟云学术

A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations

Published:2018-07-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation
language:
Short-container-title:

Author:

Berthomieu Jérémy¹,Faugère Jean-Charles¹

Affiliation:

1. Sorbonne Université, CNRS, INRIA, LIP6, Équipe PolSys, Paris, France

Funder

Fondation Mathématique Jacques Hadamard

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3208976.3209017

Reference27 articles.

1. A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants

2. Nonbinary BCH decoding (Abstr.)

3. Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences

4. Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences

5. J. Berthomieu and J.-Ch. Faugère. 2017. In-depth comparison of the Berlekamp -- Massey -- Sakata and the Scalar-FGLM algorithms: the non adaptive variants. (May 2017). https://hal.inria.fr/hal-01516708 preprint. J. Berthomieu and J.-Ch. Faugère. 2017. In-depth comparison of the Berlekamp -- Massey -- Sakata and the Scalar-FGLM algorithms: the non adaptive variants. (May 2017). https://hal.inria.fr/hal-01516708 preprint.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Guessing with Little Data;Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation;2022-07-04

2. Guessing Gröbner bases of structured ideals of relations of sequences;Journal of Symbolic Computation;2022-07

3. Polynomial-division-based algorithms for computing linear recurrence relations;Journal of Symbolic Computation;2022-03

4. Algorithms for Linearly Recurrent Sequences of Truncated Polynomials;Proceedings of the 2021 on International Symposium on Symbolic and Algebraic Computation;2021-07-18

5. Computing syzygies in finite dimension using fast linear algebra;Journal of Complexity;2020-10