A note on upper bounds for ideal-theoretic problems
From MaRDI portal
Publication:1185454
DOI10.1016/S0747-7171(08)80086-7zbMath0787.13010WikidataQ55883678 ScholiaQ55883678MaRDI QIDQ1185454
Publication date: 28 June 1992
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Computational aspects and applications of commutative rings (13P99) Syzygies, resolutions, complexes and commutative rings (13D02) Ideals and multiplicative ideal theory in commutative rings (13A15)
Related Items
An improvement of the rational representation for high-dimensional systems, Ideals generated by quadrics exhibiting double exponential degrees, Bounding the degrees of a minimal \(\mu\)-basis for a rational surface parametrization, Macaulay-like marked bases, Decomposition of polynomial sets into characteristic pairs, Fast computation of Gröbner basis of homogeneous ideals of \(\mathbb{F}[x, y\)], Trajectories of polynomial vector fields and ascending chains of polynomial ideals, A new lower bound construction for commutative Thue systems with applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving systems of algebraic equations by a general elimination method
- Gröbner bases and primary decomposition of polynomial ideals
- Résolution des systèmes d'équations algébriques
- A new method for solving algebraic systems of positive dimension
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- The evaluation of the zeros of ill-conditioned polynomials. I, II
- Solving systems of algebraic equations by using gröbner bases
- Properties of Gröbner bases under specializations
