On the public citation graph

Some bounds for the construction of Gröbner bases

https://doi.org/10.1007/bfb0039192
0 signed · 26 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-09519-5openalex-snapshot
Symbolic and Algebraic Computation
inferredcites →https://doi.org/10.1007/3-540-12868-9_98openalex-snapshot
A note on the complexity of constructing Gröbner-bases
inferredcites →https://doi.org/10.1007/3-540-12868-9_99openalex-snapshot
Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations
inferredcites →https://doi.org/10.1007/3-540-13331-3_39openalex-snapshot
A critical-pair/completion algorithm for finitely generated ideals in rings
inferredcites →https://doi.org/10.1007/3-540-15984-3_300openalex-snapshot
A note on the complexity of constructing standard bases
inferredcites →https://doi.org/10.1007/3-540-51082-6_96openalex-snapshot
Constructing universal Gröbner bases
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/bfb0032839openalex-snapshot
Some effectivity problems in polynomial ideal theory
inferredcites →https://doi.org/10.1007/bfb0032840openalex-snapshot
Upper and lower bounds for the degree of Groebner bases
inferredcites →https://doi.org/10.1007/bfb0032841openalex-snapshot
On the complexity of the Gröbner-bases algorithm over K[x,y,z]
inferredcites →https://doi.org/10.1007/bfb0032842openalex-snapshot
Algorithms for computing Gröbner bases of polynomial ideals over various Euclidean rings
inferredcites →https://doi.org/10.1016/0001-8708(82)90048-2openalex-snapshot
The complexity of the word problems for commutative semigroups and polynomial ideals
inferredcites →https://doi.org/10.1016/0021-8693(75)90101-5openalex-snapshot
Model-completeness and elimination of quantifiers for subdirect products of structures
inferredcites →https://doi.org/10.1016/s0049-237x(08)71098-xopenalex-snapshot
Fundamentals of Model Theory
inferredcites →https://doi.org/10.1016/s0049-237x(08)71116-9openalex-snapshot
Decidable Theories
inferredcites →https://doi.org/10.1137/0215042openalex-snapshot
The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-51082-6_96openalex-snapshot
Constructing universal Gröbner bases
inferred← citeshttps://doi.org/10.1007/978-1-4612-2628-4_30openalex-snapshot
Degree Bounds of Gröbner Bases
inferred← citeshttps://doi.org/10.1007/978-3-642-57201-2_16openalex-snapshot
Three Remarks on Comprehensive Gröbner and SAGBI Bases
inferred← citeshttps://doi.org/10.1007/bf01188747openalex-snapshot
A solution to Kronecker's problem
inferred← citeshttps://doi.org/10.1016/0022-4049(89)90071-6openalex-snapshot
On the Jacobian conjecture: a new approach via Gröbner bases
inferred← citeshttps://doi.org/10.1016/0747-7171(92)90023-wopenalex-snapshot
Comprehensive Gröbner bases
inferred← citeshttps://doi.org/10.1016/j.jpaa.2008.11.022openalex-snapshot
Degree bounds for Gröbner bases in algebras of solvable type
inferred← citeshttps://doi.org/10.1016/s0747-7171(88)80045-2openalex-snapshot
Computing dimension and independent sets for polynomial ideals
inferred← citeshttps://doi.org/10.1081/agb-200061031openalex-snapshot
Reduction Mod p of Standard Bases
inferred← citeshttps://doi.org/10.1109/18.333885openalex-snapshot
Use of Grobner bases to decode binary cyclic codes up to the true minimum distance
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.