On the public citation graph
On the efficiency of effective Nullstellens�tze
0 signed · 67 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.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.1007/3-540-51082-6_85openalex-snapshot
On the computational complexity of polynomials and bilinear mappings. A survey
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/3-540-51084-2_13openalex-snapshot
Solving systems of algebraic equations
inferredcites →https://doi.org/10.1007/978-1-4612-0441-1_11openalex-snapshot
Algorithmes – disons rapides – pour la décomposition d’une variété algébrique en composantes irréductibles et équidimensionnelles
inferredcites →https://doi.org/10.1007/978-1-4612-0441-1_29openalex-snapshot
Some Effective Methods in the Openness of Loci for Cohen-Macaulay and Gorenstein Properties
inferredcites →https://doi.org/10.1007/978-1-4612-0441-1_3openalex-snapshot
Local Membership Problems for Polynomial Ideals
inferredcites →https://doi.org/10.1007/bf02579205openalex-snapshot
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
inferredcites →https://doi.org/10.1007/bfb0016236openalex-snapshot
Parallel arithmetic computations: A survey
inferredcites →https://doi.org/10.1016/0020-0190(84)90018-8openalex-snapshot
On computing the determinant in small parallel time using a small number of processors
inferredcites →https://doi.org/10.1016/0166-218x(91)90109-aopenalex-snapshot
The membership problem for unmixed polynomial ideals is solvable in single exponential time
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/0304-3975(89)90093-5openalex-snapshot
On the representation of rational functions of bounded complexity
inferredcites →https://doi.org/10.1090/s0894-0347-1988-0944576-7openalex-snapshot
Sharp Effective Nullstellensatz
inferredcites →https://doi.org/10.1137/0212043openalex-snapshot
Fast Parallel Computation of Polynomials Using Few Processors
inferredcites →https://doi.org/10.1145/321662.321664openalex-snapshot
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
inferredcites →https://doi.org/10.2307/1971361openalex-snapshot
Bounds for the Degrees in the Nullstellensatz
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcom.1997.0433openalex-snapshot
Elimination of Constants from Machines over Algebraically Closed Fields
inferred← citeshttps://doi.org/10.1006/jcom.1997.0447openalex-snapshot
Some Complexity Results for Polynomial Ideals
inferred← citeshttps://doi.org/10.1006/jcom.2000.0571openalex-snapshot
A Gröbner Free Alternative for Polynomial System Solving
inferred← citeshttps://doi.org/10.1007/3-540-60114-7_16openalex-snapshot
When polynomial equation systems can be “solved” fast?
inferred← citeshttps://doi.org/10.1007/3-540-60114-7_4openalex-snapshot
How lower and upper complexity bounds meet in elimination theory
inferred← citeshttps://doi.org/10.1007/3-540-60114-7_8openalex-snapshot
On the computation of the radical of polynomial complete intersection ideals
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_42openalex-snapshot
On polynomial ideals, their complexity, and applications
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-0348-9104-2_11openalex-snapshot
A computational method for diophantine approximation
inferred← citeshttps://doi.org/10.1007/978-3-319-02297-0_13openalex-snapshot
Complexity in Tropical Algebra (Invited Talk)
inferred← citeshttps://doi.org/10.1007/bf01198015openalex-snapshot
Bounds for Traces in Complete Intersections and Degrees in the Nullstellensatz
inferred← citeshttps://doi.org/10.1007/pl00004746openalex-snapshot
On the degrees of bases of free modulesover a polynomial ring
inferred← citeshttps://doi.org/10.1007/s00200-014-0213-8openalex-snapshot
An algorithm for implicit interpolation
inferred← citeshttps://doi.org/10.1007/s00200-026-00726-9openalex-snapshot
A Kronecker algorithm for locally closed sets over a perfect field
inferred← citeshttps://doi.org/10.1007/s002000000046openalex-snapshot
On the Time-Space Complexity of Geometric Elimination Procedures
inferred← citeshttps://doi.org/10.1007/s002000050057openalex-snapshot
On Intrinsic Bounds in the Nullstellensatz
inferred← citeshttps://doi.org/10.1007/s002000050115openalex-snapshot
Probabilistic Algorithms for Geometric Elimination
inferred← citeshttps://doi.org/10.1007/s00454-018-9966-3openalex-snapshot
Tropical Effective Primary and Dual Nullstellensätze
inferred← citeshttps://doi.org/10.1007/s10208-002-0065-7openalex-snapshot
The Hardness of Polynomial Equation Solving
inferred← citeshttps://doi.org/10.1007/s10208-002-0078-2openalex-snapshot
The Computational Complexity of the Chow Form
inferred← citeshttps://doi.org/10.1016/j.aam.2011.11.004openalex-snapshot
On a tropical dual Nullstellensatz
inferred← citeshttps://doi.org/10.1016/j.exmath.2007.07.001openalex-snapshot
A concise proof of the Kronecker polynomial system solver from scratch
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2012.03.008openalex-snapshot
Polynomial bounds for invariant functions separating orbits
inferred← citeshttps://doi.org/10.1016/j.jco.2004.09.008openalex-snapshot
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
inferred← citeshttps://doi.org/10.1016/j.jsc.2006.03.005openalex-snapshot
Rational invariants of a group action. Construction and rewriting
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.01.009openalex-snapshot
Deformation techniques to solve generalised Pham systems
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00016-1openalex-snapshot
Black-box polynomial resultants
inferred← citeshttps://doi.org/10.1016/s0022-4049(00)00135-3openalex-snapshot
Computing bases of complete intersection rings in Noether position
inferred← citeshttps://doi.org/10.1016/s0022-4049(01)00083-4openalex-snapshot
Effective equidimensional decomposition of affine varieties
inferred← citeshttps://doi.org/10.1016/s0022-4049(96)00099-0openalex-snapshot
Straight-line programs in geometric elimination theory
inferred← citeshttps://doi.org/10.1016/s0022-4049(97)00015-7openalex-snapshot
Lower bounds for diophantine approximations
inferred← citeshttps://doi.org/10.1016/s0022-4049(97)00068-6openalex-snapshot
An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs
inferred← citeshttps://doi.org/10.1016/s0378-4754(97)00085-2openalex-snapshot
Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs
inferred← citeshttps://doi.org/10.1016/s0378-4754(99)00140-8openalex-snapshot
On the data structure straight-line program and its implementation in symbolic computation
inferred← citeshttps://doi.org/10.1016/s0764-4442(97)83558-6openalex-snapshot
Le rôle des structures de données dans les problèmes d'élimination
inferred← citeshttps://doi.org/10.1090/s0025-5718-06-01878-3openalex-snapshot
Fast computation of a rational point of a variety over a finite field
inferred← citeshttps://doi.org/10.1109/itw.2006.1633775openalex-snapshot
Inverting bijective polynomial maps over finite fields
inferred← citeshttps://doi.org/10.1145/3373207.3404058openalex-snapshot
On the bit complexity of finding points in connected components of a smooth real hypersurface
inferred← citeshttps://doi.org/10.1215/s0012-7094-01-10934-4openalex-snapshot
Sharp estimates for the arithmetic Nullstellensatz
inferred← citeshttps://doi.org/10.1353/ajm.1999.0026openalex-snapshot
Residue calculus and effective Nullstellensatz
inferred← citeshttps://doi.org/10.4310/ajm.2011.v15.n2.a4openalex-snapshot
Effective Hironaka resolution and its complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1206.3090openalex-snapshot
Effective Hironaka resolution and its Complexity (with appendix on applications in positive characteristic)
inferred← citeshttps://doi.org/10.48550/arxiv.math/0506574openalex-snapshot
Rational, Replacement, and Local Invariants of a Group Action
inferred← citeshttps://doi.org/10.70675/c7a5fb51z8a3bz478ez81c3z3133f376ed91openalex-snapshot
Analytic Combinatorics in Several Variables : Effective Asymptotics and Lattice Path Enumeration
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.