On the public citation graph

Computing Gröbner Bases for Vanishing Ideals of Finite Sets of Points

0 signed · 43 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.1006/jcom.1997.0439openalex-snapshot
Decoding of Reed Solomon Codes beyond the Error-Correction Bound
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.2000.0411openalex-snapshot
Computing Ideals of Points
inferredcites →https://doi.org/10.1007/3-540-11607-9_3openalex-snapshot
The construction of multivariate polynomials with preassigned zeros
inferredcites →https://doi.org/10.1007/3-540-28296-3openalex-snapshot
Computational Commutative Algebra 2
inferredcites →https://doi.org/10.1007/978-1-4757-6911-1openalex-snapshot
Using Algebraic Geometry
inferredcites →https://doi.org/10.1007/978-3-7091-3406-1openalex-snapshot
Computer Algebra
inferredcites →https://doi.org/10.1007/b138611openalex-snapshot
Using Algebraic Geometry
inferredcites →https://doi.org/10.1007/bf01386834openalex-snapshot
Gr�bner bases of ideals defined by functionals with an application to ideals of projective points
inferredcites →https://doi.org/10.1016/0012-365x(94)00126-4openalex-snapshot
From algebraic sets to monomial linear bases by means of combinatorial algorithms
inferredcites →https://doi.org/10.1016/j.jtbi.2004.04.037openalex-snapshot
A computational algebra approach to the reverse engineering of gene regulatory networks
inferredcites →https://doi.org/10.1016/s0024-3795(01)00509-2openalex-snapshot
Gröbner basis solutions of constrained interpolation problems
inferredcites →https://doi.org/10.1016/s0024-3795(02)00309-9openalex-snapshot
Fourth special issue on linear systems and control
inferredcites →https://doi.org/10.1017/cbo9780511565847.010openalex-snapshot
Gröbner Bases and Statistics
inferredcites →https://doi.org/10.1017/cbo9780511565847.030openalex-snapshot
Polynomial interpolation of Minimal Degree and Gröbner Bases
inferredcites →https://doi.org/10.1023/a:1018981505752openalex-snapshot
Polynomial interpolation in several variables
inferredcites →https://doi.org/10.1090/s0002-9947-96-01671-6openalex-snapshot
On multiplicities in polynomial system solving
inferredcites →https://doi.org/10.1090/s0025-5718-05-01790-4openalex-snapshot
Gröbner bases and generalized Padé approximation
inferredcites →https://doi.org/10.1109/18.782097openalex-snapshot
Improved decoding of Reed-Solomon and algebraic-geometry codes
inferredcites →https://doi.org/10.1109/tit.2003.819332openalex-snapshot
Algebraic soft-decision decoding of reed-solomon codes
inferredcites →https://doi.org/10.1112/blms/28.6.667openalex-snapshot
AN INTRODUCTION TO GRÖBNER BASES (Graduate Studies in Mathematics 3)

What points at this work

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

inferred← citeshttps://doi.org/10.1002/sec.930openalex-snapshot
Reducing shadow size in smooth scalable secret image sharing
inferred← citeshttps://doi.org/10.1007/978-3-030-42687-3_9openalex-snapshot
The Number of Gröbner Bases in Finite Fields (Research)
inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4_3openalex-snapshot
The FGLM Problem and Möller’s Algorithm on Zero-dimensional Ideals
inferred← citeshttps://doi.org/10.1007/978-3-642-01960-9_6openalex-snapshot
Some Meeting Points of Gröbner Bases and Combinatorics
inferred← citeshttps://doi.org/10.1007/978-3-642-21493-6_4openalex-snapshot
Some Combinatorial Applications of Gröbner Bases
inferred← citeshttps://doi.org/10.1007/s00200-022-00586-zopenalex-snapshot
Degröbnerization: a political manifesto
inferred← citeshttps://doi.org/10.1007/s10994-026-07112-zopenalex-snapshot
Discovery of Exact Equations via Computing the Gröbner Basis
inferred← citeshttps://doi.org/10.1007/s11424-015-2202-9openalex-snapshot
The Fitzpatrick-Neville-type algorithm for multivariate vector-valued osculatory rational interpolation
inferred← citeshttps://doi.org/10.1007/s11424-016-4113-9openalex-snapshot
A two-dimensional improvement for Farr-Gao algorithm
inferred← citeshttps://doi.org/10.1007/s11424-016-4114-8openalex-snapshot
An algorithm for the discretization of an ideal projector
inferred← citeshttps://doi.org/10.1007/s11538-019-00624-xopenalex-snapshot
Geometric Characterization of Data Sets with Unique Reduced Gröbner Bases
inferred← citeshttps://doi.org/10.1016/j.cam.2016.05.012openalex-snapshot
The discretization for bivariate ideal interpolation
inferred← citeshttps://doi.org/10.1090/conm/826/16570openalex-snapshot
Gröbnerian and Gröbner free techniques on non-associative algebras
inferred← citeshttps://doi.org/10.1109/cvpr.2019.00628openalex-snapshot
Polynomial Representation for Persistence Diagram
inferred← citeshttps://doi.org/10.1109/tcad.2006.888277openalex-snapshot
Equivalence Verification of Polynomial Datapaths Using Ideal Membership Testing
inferred← citeshttps://doi.org/10.1145/1279721.1279722openalex-snapshot
Computing Gröbner bases of ideals of few points in high dimensions
inferred← citeshttps://doi.org/10.3934/math.2024948openalex-snapshot
Algorithms for computing Gröbner bases of ideal interpolation
inferred← citeshttps://doi.org/10.48550/arxiv.0711.3475openalex-snapshot
Efficiently computing Groebner bases of ideals of points
inferred← citeshttps://doi.org/10.48550/arxiv.2107.05353openalex-snapshot
Polynomials vanishing at lattice points in a convex set
inferred← citeshttps://doi.org/10.48550/arxiv.2111.07340openalex-snapshot
Computing Groebner bases of ideal interpolation
inferred← citeshttps://doi.org/10.5902/2179460x87459openalex-snapshot
A solution to the time-dependent two-dimensional Navier-Stokes equation in a rectangular domain using the Adomian decomposition method and theory of Gröbner Basis
inferred← citeshttps://doi.org/10.62056/an5tx4e-openalex-snapshot
Boomy: Batch Opening Of Multivariate polYnomial commitment
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.