Chinese Remainder Theorem for bivariate lexicographic Gröbner bases
From MaRDI portal
Publication:6060370
DOI10.1145/3597066.3597082OpenAlexW4383213639WikidataQ131124343 ScholiaQ131124343MaRDI QIDQ6060370
Publication date: 3 November 2023
Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3597066.3597082
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On decomposing systems of polynomial equations with finitely many solutions
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Ideal basis and primary decompositions: case of two variables
- A remark on a remark by Macaulay or enhancing Lazard structural theorem
- Fast computation of generic bivariate resultants
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
- The lex game and some applications
- The vanishing ideal of a finite set of closed points in affine space
- Size of coefficients of lexicographical Groöbner bases
- Factoring into coprimes in essentially linear time
- Fast Reduction of Bivariate Polynomials with Respect to Sufficiently Regular Gröbner Bases
- On Computing the Resultant of Generic Bivariate Polynomials
- Change of Basis for m-primary Ideals in One and Two Variables
- Elimination ideal and bivariate resultant over finite fields
This page was built for publication: Chinese Remainder Theorem for bivariate lexicographic Gröbner bases
