Algorithmic properties of polynomial rings
From MaRDI portal
Publication:1273764
DOI10.1006/jsco.1998.0227zbMath0920.68129OpenAlexW2052706303MaRDI QIDQ1273764
Publication date: 13 September 1999
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1998.0227
Related Items
A topological view on algebraic computation models, Algorithms for computing triangular decomposition of polynomial systems, Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case, When does \(\langle T \rangle\) equal \(\text{sat}(T)\)?, On the theories of triangular sets, Triangular sets for solving polynomial systems: a comparative implementation of four methods, New developments in the theory of Gröbner bases and applications to formal verification, On the complexity of counting components of algebraic varieties, Computer algebra and algebraic geometry -- achievements and perspectives, Multiplicity-preserving triangular set decomposition of two polynomials, Gröbner bases in orders of algebraic number fields.
