Faster Change of Order Algorithm for Gröbner Bases under Shape and Stability Assumptions-Reference-Cited by-同舟云学术

Faster Change of Order Algorithm for Gröbner Bases under Shape and Stability Assumptions

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

Author:

Berthomieu Jérémy¹,Neiger Vincent¹,Safey El Din Mohab¹

Affiliation:

1. Sorbonne Université, CNRS, LIP6, Paris, France

Publisher

ACM

Link

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

Reference47 articles.

1. Improved Complexity Bounds for Counting Points on Hyperelliptic Curves

2. A theorem on refining division orders by the reverse lexicographic order

3. E. Becker , T. Mora , M.G. Marinari , and C. Traverso . 1994. The Shape of the Shape Lemma . In Proceedings ISSAC 1994 . ACM, 129--133. https://doi.org/10.1145/ 1903 47.190382 E. Becker, T. Mora, M.G. Marinari, and C. Traverso. 1994. The Shape of the Shape Lemma. In Proceedings ISSAC 1994. ACM, 129--133. https://doi.org/10.1145/190347.190382

4. T. Becker V. Weispfenning and H. Kredel. 1993. Gröbner bases -- A computational approach to commutative algebra. Graduate texts in mathematics Vol. 141. Springer. T. Becker V. Weispfenning and H. Kredel. 1993. Gröbner bases -- A computational approach to commutative algebra. Graduate texts in mathematics Vol. 141. Springer.

5. Normal forms for general polynomial matrices

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

1. Bivariate polynomial reduction and elimination ideal over finite fields;Journal of Symbolic Computation;2025-03

2. Computing Generic Fibers of Polynomial Ideals with FGLM and Hensel Lifting;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16

3. The Algebraic FreeLunch: Efficient Gröbner Basis Attacks Against Arithmetization-Oriented Primitives;Lecture Notes in Computer Science;2024

4. Elimination ideal and bivariate resultant over finite fields;Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation;2023-07-24

5. Finer Complexity Estimates for the Change of Ordering of Gröbner Bases for Generic Symmetric Determinantal Ideals;Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation;2022-07-04