On the public citation graph

A Sparse Effective Nullstellensatz

0 signed · 80 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.1002/mana.19901490118openalex-snapshot
Nullstellensatz effectif et Conjecture de Serre (Théorème de Quillen‐Suslin) pour le Calcul Formel
inferredcites →https://doi.org/10.1006/jsco.1993.1020openalex-snapshot
A Combinatorial Proof of the Effective Nullstellensatz
inferredcites →https://doi.org/10.1007/3-540-51083-4_54openalex-snapshot
Some new effectivity bounds in computational geometry
inferredcites →https://doi.org/10.1007/978-3-0348-9104-2_11openalex-snapshot
A computational method for diophantine approximation
inferredcites →https://doi.org/10.1007/978-3-0348-9104-2_2openalex-snapshot
On a conjecture of C. Berenstein and A. Yger
inferredcites →https://doi.org/10.1007/978-3-642-60539-0openalex-snapshot
Foundations of Computational Mathematics
inferredcites →https://doi.org/10.1007/978-3-642-60539-0_30openalex-snapshot
Toric Laminations, Sparse Generalized Characteristic Polynomials, and a Refinement of Hubert’s Tenth Problem
inferredcites →https://doi.org/10.1007/bf01075534openalex-snapshot
Newton polytopes and the Bezout theorem
inferredcites →https://doi.org/10.1007/bf01075595openalex-snapshot
The number of roots of a system of equations
inferredcites →https://doi.org/10.1007/bf01198015openalex-snapshot
Bounds for Traces in Complete Intersections and Degrees in the Nullstellensatz
inferredcites →https://doi.org/10.1007/bf01444501openalex-snapshot
Bounds on degrees of projective schemes
inferredcites →https://doi.org/10.1007/bf02398884openalex-snapshot
Effective Bezout identities in Q[z1, ..., zn]
inferredcites →https://doi.org/10.1007/bf03323286openalex-snapshot
On the ampleness of invertible sheaves in complete projective toric varieties
inferredcites →https://doi.org/10.1007/s002000050057openalex-snapshot
On Intrinsic Bounds in the Nullstellensatz
inferredcites →https://doi.org/10.1016/0024-3795(91)90115-dopenalex-snapshot
Recent improvements in the complexity of the effective Nullstellensatz
inferredcites →https://doi.org/10.1016/0304-3975(83)90002-6openalex-snapshot
Definability and fast quantifier elimination in algebraically closed fields
inferredcites →https://doi.org/10.1016/s0022-4049(96)00099-0openalex-snapshot
Straight-line programs in geometric elimination theory
inferredcites →https://doi.org/10.1016/s0022-4049(97)00015-7openalex-snapshot
Lower bounds for diophantine approximations
inferredcites →https://doi.org/10.1016/s0022-4049(97)00028-5openalex-snapshot
Bounds for the Hubert function of polynomial ideals and for the degrees in the Nullstellensatz
inferredcites →https://doi.org/10.1016/s0022-4049(98)00148-0openalex-snapshot
On the intrinsic complexity of the arithmetic Nullstellensatz
inferredcites →https://doi.org/10.1017/cbo9781139171762openalex-snapshot
Commutative Ring Theory
inferredcites →https://doi.org/10.1070/rm1978v033n02abeh002305openalex-snapshot
THE GEOMETRY OF TORIC VARIETIES
inferredcites →https://doi.org/10.1090/s0025-5718-1995-1297471-4openalex-snapshot
A Polyhedral Method for Solving Sparse Polynomial Systems
inferredcites →https://doi.org/10.1090/s0894-0347-1988-0944576-7openalex-snapshot
Sharp Effective Nullstellensatz
inferredcites →https://doi.org/10.1090/ulect/008openalex-snapshot
Gröbner Bases and Convex Polytopes
inferredcites →https://doi.org/10.1137/0731049openalex-snapshot
Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
inferredcites →https://doi.org/10.1145/337244.337247openalex-snapshot
A subdivision-based algorithm for the sparse resultant
inferredcites →https://doi.org/10.1215/s0012-7094-80-04718-3openalex-snapshot
Multiplicity estimates for analytic functions II
inferredcites →https://doi.org/10.1307/mmj/1029003939openalex-snapshot
Degree bounds for the division problem in polynomial ideals.
inferredcites →https://doi.org/10.2307/1971361openalex-snapshot
Bounds for the Degrees in the Nullstellensatz
inferredcites →https://doi.org/10.4064/aa-58-1-1-25openalex-snapshot
Dénominateurs dans le théorème des zéros de Hilbert
inferredcites →https://doi.org/10.48550/arxiv.math/9702222openalex-snapshot
Toric Generalized Characteristic Polynomials
inferredcites →https://doi.org/10.5860/choice.30-5053aopenalex-snapshot
Algebraic geometry: a first course

What points at this work

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

inferred← citeshttps://doi.org/10.1006/aama.1999.0676openalex-snapshot
Gröbner Bases for Spaces of Quadrics of Low Codimension
inferred← citeshttps://doi.org/10.1007/978-3-030-12558-5_5openalex-snapshot
Nullstellensatz via Nonstandard Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-63702-6_17openalex-snapshot
Grete Hermann and Effective Methods in Geometry
inferred← citeshttps://doi.org/10.1007/978-3-0348-0142-3_2openalex-snapshot
Variants of the Effective Nullstellensatz and Residue Calculus
inferred← citeshttps://doi.org/10.1007/s00200-017-0342-yopenalex-snapshot
A Pommaret bases approach to the degree of a polynomial ideal
inferred← citeshttps://doi.org/10.1007/s00208-010-0575-6openalex-snapshot
Sparse effective membership problems via residue currents
inferred← citeshttps://doi.org/10.1007/s00209-016-1667-0openalex-snapshot
Division formulas on projective varieties
inferred← citeshttps://doi.org/10.1007/s00222-004-0434-8openalex-snapshot
On the effective Nullstellensatz
inferred← citeshttps://doi.org/10.1007/s00222-014-0544-xopenalex-snapshot
Global effective versions of the Briançon–Skoda–Huneke theorem
inferred← citeshttps://doi.org/10.1007/s002220050332openalex-snapshot
A geometric effective Nullstellensatz
inferred← citeshttps://doi.org/10.1007/s10013-024-00687-xopenalex-snapshot
New Dimensional Estimates for Subvarieties of Linear Algebraic Groups
inferred← citeshttps://doi.org/10.1007/s100970050009openalex-snapshot
Effective Nullstellensatz for arbitrary ideals
inferred← citeshttps://doi.org/10.1016/j.automatica.2025.112236openalex-snapshot
Rank resilience of pattern matrices against structured perturbations with applications
inferred← citeshttps://doi.org/10.1016/j.entcs.2018.06.009openalex-snapshot
On the Computational Complexity of Information Hiding
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2019.06.014openalex-snapshot
On degree bounds for the sparse Nullstellensatz
inferred← citeshttps://doi.org/10.1016/j.jco.2021.101588openalex-snapshot
A promenade through correct test sequences I: Degree of constructible sets, Bézout's Inequality and density
inferred← citeshttps://doi.org/10.1016/j.jsc.2015.06.003openalex-snapshot
Solving a sparse system using linear algebra
inferred← citeshttps://doi.org/10.1016/j.jsc.2021.11.003openalex-snapshot
Degree bounds for Gröbner bases of modules
inferred← citeshttps://doi.org/10.1016/j.laa.2014.12.027openalex-snapshot
The product of matrix subspaces
inferred← citeshttps://doi.org/10.1016/s0021-8693(02)00147-3openalex-snapshot
Index of nilpotency of binomial ideals
inferred← citeshttps://doi.org/10.1016/s0022-4049(98)00148-0openalex-snapshot
On the intrinsic complexity of the arithmetic Nullstellensatz
inferred← citeshttps://doi.org/10.1080/00927870802110342openalex-snapshot
Finite Type and the Effective Nullstellensatz
inferred← citeshttps://doi.org/10.1080/00927872.2015.1033717openalex-snapshot
Puiseux Expansions and Nonisolated Points in Algebraic Varieties
inferred← citeshttps://doi.org/10.1080/00927872.2018.1448835openalex-snapshot
Height bounds, nullstellensatz and primality
inferred← citeshttps://doi.org/10.1090/proc/12781openalex-snapshot
An analytic approach to the degree bound in the Nullstellensatz
inferred← citeshttps://doi.org/10.1090/s0894-0347-04-00451-5openalex-snapshot
Ideal membership in polynomial rings over the integers
inferred← citeshttps://doi.org/10.1093/imrn/rnaf174openalex-snapshot
Sparse Nullstellensatz, Resultants, and Determinants of Complexes
inferred← citeshttps://doi.org/10.1093/imrn/rnq127openalex-snapshot
A Refinement of a Mixed Sparse Effective Nullstellensatz
inferred← citeshttps://doi.org/10.1093/imrn/rnz123openalex-snapshot
Generalizations of Stillman’s Conjecture via Twisted Commutative Algebra
inferred← citeshttps://doi.org/10.1093/qmathj/haaa001openalex-snapshot
Effective Versions of Two Theorems of RADO
inferred← citeshttps://doi.org/10.1103/fzjk-8w3mopenalex-snapshot
Rigorous no-go theorems for heralded linear-optical state generation tasks
inferred← citeshttps://doi.org/10.1109/focs.2014.20openalex-snapshot
Circuit Complexity, Proof Complexity, and Polynomial Identity Testing
inferred← citeshttps://doi.org/10.1112/blms/bdu064openalex-snapshot
A tracial Nullstellensatz
inferred← citeshttps://doi.org/10.1137/s003614450444614xopenalex-snapshot
A Survey of the S-Lemma
inferred← citeshttps://doi.org/10.1145/3326229.3326248openalex-snapshot
Gröbner Basis over Semigroup Algebras
inferred← citeshttps://doi.org/10.1145/3373207.3404030openalex-snapshot
Special-case algorithms for blackbox radical membership, nullstellensatz and transcendence degree
inferred← citeshttps://doi.org/10.1145/347127.360386openalex-snapshot
Index of nilpotency of binomial ideals
inferred← citeshttps://doi.org/10.1215/dmj/1000314065openalex-snapshot
Sharp estimates for the arithmetic Nullstellensatz
inferred← citeshttps://doi.org/10.1215/s0012-7094-01-10934-4openalex-snapshot
Sharp estimates for the arithmetic Nullstellensatz
inferred← citeshttps://doi.org/10.1216/jca-2010-2-4-567openalex-snapshot
Some variants of Macaulay's and Max Noether's theorems
inferred← citeshttps://doi.org/10.13001/ela.2017.1783openalex-snapshot
The common invariant subspace problem and Tarski’s theorem
inferred← citeshttps://doi.org/10.24330/ieja.266217openalex-snapshot
NOTE ON THE REGULARITY OF THE RADICAL OF IDEALS
inferred← citeshttps://doi.org/10.4171/rmi/834openalex-snapshot
Interpolation of ideals
inferred← citeshttps://doi.org/10.48550/arxiv.1503.06054openalex-snapshot
A global Brianç con-Skoda-Huneke-Sznajdman theorem
inferred← citeshttps://doi.org/10.5802/jep.114openalex-snapshot
A new inequality about matrix products and a Berger-Wang formula
inferred← citeshttps://doi.org/10.70675/09e4d597z5a94z4946zb268zbccc484888f9openalex-snapshot
Algorithms for sparse polynomial systems : Gröbner bases and resultants
inferred← citeshttps://doi.org/10.7907/2k6y-ch43.openalex-snapshot
Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization
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.