On the public citation graph
Decomposition of polynomial sets into characteristic pairs
0 signed · 58 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jsco.1993.1011openalex-snapshot
A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic Varieties
inferredcites →https://doi.org/10.1006/jsco.1993.1035openalex-snapshot
An Elimination Method for Polynomial Systems
inferredcites →https://doi.org/10.1006/jsco.1993.1051openalex-snapshot
Efficient Computation of Zero-dimensional Gröbner Bases by Change of Ordering
inferredcites →https://doi.org/10.1006/jsco.1996.0052openalex-snapshot
Localization and Primary Decomposition of Polynomial Ideals
inferredcites →https://doi.org/10.1006/jsco.1996.0145openalex-snapshot
Converting Bases with the Gröbner Walk
inferredcites →https://doi.org/10.1006/jsco.1997.0177openalex-snapshot
Decomposing Polynomial Systems into Simple Systems
inferredcites →https://doi.org/10.1006/jsco.1999.0269openalex-snapshot
On the Theories of Triangular Sets
inferredcites →https://doi.org/10.1006/jsco.1999.0270openalex-snapshot
Triangular Sets for Solving Polynomial Systems: a Comparative Implementation of Four Methods
inferredcites →https://doi.org/10.1006/jsco.1999.0355openalex-snapshot
Computing Triangular Systems and Regular Systems
inferredcites →https://doi.org/10.1007/3-540-15984-3_279openalex-snapshot
About a new method for computing in algebraic number fields
inferredcites →https://doi.org/10.1007/3-540-45084-x_1openalex-snapshot
Notes on Triangular Sets and Triangulation-Decomposition Algorithms I: Polynomial Systems
inferredcites →https://doi.org/10.1007/3-540-51517-8_127openalex-snapshot
Solving systems of algebraic equations by using gröbner bases
inferredcites →https://doi.org/10.1007/3-540-51517-8_128openalex-snapshot
Properties of Gröbner bases under specializations
inferredcites →https://doi.org/10.1007/3-540-52885-7_89openalex-snapshot
Ritt-Wu's decomposition algorithm and geometry theorem proving
inferredcites →https://doi.org/10.1007/978-0-387-35651-8openalex-snapshot
Ideals, Varieties, and Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-75187-8_7openalex-snapshot
Comprehensive Triangular Decomposition
inferredcites →https://doi.org/10.1007/978-3-540-87827-8_20openalex-snapshot
An Algorithm for Transforming Regular Chain into Normal Chain
inferredcites →https://doi.org/10.1007/978-3-7091-6639-0openalex-snapshot
Mechanical Theorem Proving in Geometries
inferredcites →https://doi.org/10.1007/978-94-009-5225-6_6openalex-snapshot
Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory
inferredcites →https://doi.org/10.1007/s11425-007-0118-0openalex-snapshot
An algorithm for decomposing a polynomial system into normal ascending sets
inferredcites →https://doi.org/10.1007/s11786-016-0279-8openalex-snapshot
On the Connection Between Ritt Characteristic Sets and Buchberger–Gröbner Bases
inferredcites →https://doi.org/10.1016/0166-218x(91)90113-bopenalex-snapshot
A new method for solving algebraic systems of positive dimension
inferredcites →https://doi.org/10.1016/0747-7171(92)90023-wopenalex-snapshot
Comprehensive Gröbner bases
inferredcites →https://doi.org/10.1016/j.jsc.2011.08.010openalex-snapshot
When does 〈T〉 equal sat(T) ?
inferredcites →https://doi.org/10.1016/j.jsc.2011.12.023openalex-snapshot
Algorithms for computing triangular decomposition of polynomial systems
inferredcites →https://doi.org/10.1016/j.jsc.2011.12.043openalex-snapshot
Algorithmic Thomas decomposition of algebraic and differential systems
inferredcites →https://doi.org/10.1016/j.jsc.2012.05.008openalex-snapshot
On the complexity of computing with zero-dimensional triangular sets
inferredcites →https://doi.org/10.1016/j.jsc.2014.09.022openalex-snapshot
Triangular systems and a generalization of primitive polynomials
inferredcites →https://doi.org/10.1016/j.tcs.2012.11.009openalex-snapshot
Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case
inferredcites →https://doi.org/10.1016/s0022-4049(00)00136-5openalex-snapshot
On the links between triangular sets and dynamic constructible closure
inferredcites →https://doi.org/10.1016/s0022-4049(99)00005-5openalex-snapshot
A new efficient algorithm for computing Gröbner bases (F4)
inferredcites →https://doi.org/10.1016/s0747-7171(08)80086-7openalex-snapshot
Solving zero-dimensional algebraic systems
inferredcites →https://doi.org/10.1016/s0747-7171(85)80035-3openalex-snapshot
Ideal Bases and Primary Decomposition: Case of Two Variables
inferredcites →https://doi.org/10.1016/s0747-7171(88)80040-3openalex-snapshot
Gröbner bases and primary decomposition of polynomial ideals
inferredcites →https://doi.org/10.1090/mcom/2969openalex-snapshot
A new framework for computing Gröbner bases
inferredcites →https://doi.org/10.1090/s0025-5718-2010-02399-3openalex-snapshot
Regeneration homotopies for solving systems of polynomials
inferredcites →https://doi.org/10.1142/9781848161207openalex-snapshot
Elimination Practice - Software Tools and Applications
inferredcites →https://doi.org/10.1142/9789812777171_0040openalex-snapshot
EPSILON: A LIBRARY OF SOFTWARE TOOLS FOR POLYNOMIAL ELIMINATION
inferredcites →https://doi.org/10.1142/9789812791085_0013openalex-snapshot
ON ZEROS OF ALGEBRAIC EQUATIONS — AN APPLICATION OF RITT PRINCIPLE
inferredcites →https://doi.org/10.1145/143242.143348openalex-snapshot
Solving parametric algebraic systems
inferredcites →https://doi.org/10.1145/1837934.1837946openalex-snapshot
A new algorithm for computing comprehensive Gröbner systems
inferredcites →https://doi.org/10.1145/780506.780516openalex-snapshot
A new efficient algorithm for computing Gröbner bases without reduction to zero ( F 5 )
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/mma.8158openalex-snapshot
Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
inferred← citeshttps://doi.org/10.1007/978-3-030-26831-2_9openalex-snapshot
On Characteristic Decomposition and Quasi-characteristic Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-319-66320-3_7openalex-snapshot
Decomposing Polynomial Sets Simultaneously into Gröbner Bases and Normal Triangular Sets
inferred← citeshttps://doi.org/10.1007/s11424-019-8356-0openalex-snapshot
Characteristic Decomposition: From Regular Sets to Normal Sets
inferred← citeshttps://doi.org/10.1007/s11424-024-3419-2openalex-snapshot
Simple Characteristic Decomposition of Polynomial Sets
inferred← citeshttps://doi.org/10.1016/j.jsc.2020.06.012openalex-snapshot
Computing strong regular characteristic pairs with Gröbner bases
inferred← citeshttps://doi.org/10.1016/j.jsc.2023.102273openalex-snapshot
Squarefree normal representation of zeros of zero-dimensional polynomial systems
inferred← citeshttps://doi.org/10.1016/j.jsc.2026.102553openalex-snapshot
Sum-and-quotient characteristic decomposition of polynomial ideals
inferred← citeshttps://doi.org/10.1090/mcom/4099openalex-snapshot
A geometric approach to cylindrical algebraic decomposition
inferred← citeshttps://doi.org/10.1145/3338637.3338647openalex-snapshot
On W-characteristic sets of lexicographic Gröbner bases
inferred← citeshttps://doi.org/10.1145/3452143.3465536openalex-snapshot
Comprehensive Characteristic Decomposition of Parametric Polynomial Systems
inferred← citeshttps://doi.org/10.1145/3476446.3535498openalex-snapshot
Solving Sparse Polynomial Systems using Gröbner Bases and Resultants
inferred← citeshttps://doi.org/10.3390/axioms14110838openalex-snapshot
An Algorithm for Determining Whether the Quotient Ring Modulo an Ideal Has a Cyclic Basis
inferred← citeshttps://doi.org/10.48550/arxiv.1907.13537openalex-snapshot
Computing strong regular characteristic pairs with Groebner bases
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.