An algorithm for the computation of the radical of an ideal
From MaRDI portal
Publication:2958987
DOI10.1145/1145768.1145802zbMath1356.68285OpenAlexW2048891273MaRDI QIDQ2958987
Publication date: 3 February 2017
Published in: Proceedings of the 2006 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1145768.1145802
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
Complexity of Membership Problems of Different Types of Polynomial Ideals, A decision method for the integrability of differential-algebraic Pfaffian systems, Effective uniform bounding in partial differential fields, Segre-driven radicality testing, Complexity of triangular representations of algebraic sets, On decomposition of algebraic PDE systems into simple subsystems, A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals, Effective differential Nullstellensatz for ordinary DAE systems with constant coefficients, Forward analysis for WSTS, part I: completions, Combined Decision Techniques for the Existential Theory of the Reals, Zero Counting and Invariant Sets of Differential Equations
