On the public citation graph
On the complexity of the Gröbner-bases algorithm over K[x,y,z]
0 signed · 32 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.1007/3-540-09519-5_52openalex-snapshot
A criterion for detecting unnecessary reductions in the construction of Gröbner-bases
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/bf01817776openalex-snapshot
Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
inferredcites →https://doi.org/10.1007/bf01844169openalex-snapshot
Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/1088216.1088219openalex-snapshot
A theoretical basis for the reduction of polynomials to canonical forms
inferredcites →https://doi.org/10.1145/1088261.1088267openalex-snapshot
An improved algorithmic construction of Gröbner-bases for 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-15976-2_1openalex-snapshot
Basic features and development of the critical-pair/completion procedure
inferred← citeshttps://doi.org/10.1007/3-540-15984-3_301openalex-snapshot
Some algorithmic questions on ideals of differential operators
inferred← citeshttps://doi.org/10.1007/3-540-47719-5_8openalex-snapshot
New Public-Key Cryptosystem Using Divisor Class Groups
inferred← citeshttps://doi.org/10.1007/978-3-319-16721-3_1openalex-snapshot
Geometry, Algebra, and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-16721-3_10openalex-snapshot
Additional Gröbner Basis Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-16721-3_4openalex-snapshot
The Algebra–Geometry Dictionary
inferred← citeshttps://doi.org/10.1007/978-3-319-16721-3_5openalex-snapshot
Polynomial and Rational Functions on a Variety
inferred← citeshttps://doi.org/10.1007/978-3-319-16721-3_6openalex-snapshot
Robotics and Automatic Geometric Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-319-16721-3_7openalex-snapshot
Invariant Theory of Finite Groups
inferred← citeshttps://doi.org/10.1007/978-3-319-16721-3_8openalex-snapshot
Projective Algebraic Geometry
inferred← citeshttps://doi.org/10.1007/978-3-319-16721-3_9openalex-snapshot
The Dimension of a Variety
inferred← citeshttps://doi.org/10.1007/bfb0039192openalex-snapshot
Some bounds for the construction of Gröbner bases
inferred← citeshttps://doi.org/10.1016/0021-8693(86)90071-2openalex-snapshot
New constructive methods in classical Ideal theory
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/s0747-7171(86)80025-6openalex-snapshot
Computer Algebra: Past and Future
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80020-2openalex-snapshot
History and basic features of the critical-pair/completion procedure
inferred← citeshttps://doi.org/10.1016/s0747-7171(88)80009-9openalex-snapshot
Algebraic decomposition of regular curves
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80005-7openalex-snapshot
Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization
inferred← citeshttps://doi.org/10.1023/a:1008299221759openalex-snapshot
Gröbner Bases and Multidimensional FIR Multirate Systems
inferred← citeshttps://doi.org/10.1137/0215042openalex-snapshot
The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals
inferred← citeshttps://doi.org/10.4213/dm141openalex-snapshot
Решение системы полиномиальных уравнений над кольцом Галуа - Эйзенштейна с помощью канонической системы образующих полиномиального идеала
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.