A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimension

DOI10.1145/3373207.3404059OpenAlexW3103972302MaRDI QIDQ5145999

Simone Naldi, Vincent Neiger

Publication date: 22 January 2021

Published in: Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.06404

zbMATH Keywords

Gröbner basissyzygiesdivide and conquerpad approximation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (2)

Polynomial-division-based algorithms for computing linear recurrence relations ⋮ Degröbnerization: a political manifesto

This page was built for publication: A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimension