On the public citation graph

Bernstein’s theorem in affine space

https://doi.org/10.1007/bf02770870
0 signed · 63 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.1996.0009openalex-snapshot
Counting Affine Roots of Polynomial Systems via Pointed Newton Polytopes
inferredcites →https://doi.org/10.1007/bf01075595openalex-snapshot
The number of roots of a system of equations
inferredcites →https://doi.org/10.1007/bf01078167openalex-snapshot
The noncommutative Markovian property
inferredcites →https://doi.org/10.1007/bf01298184openalex-snapshot
Puiseux expansion for space curves
inferredcites →https://doi.org/10.1007/bf02711134openalex-snapshot
Mixed-volume computation by dynamic lifting applied to polynomial system solving
inferredcites →https://doi.org/10.1016/0022-4049(94)90029-9openalex-snapshot
Finding sparse systems of parameters
inferredcites →https://doi.org/10.1016/0304-3975(93)00062-aopenalex-snapshot
A convex geometric approach to counting the roots of a polynomial system
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/s0025-5718-96-00778-8openalex-snapshot
The BKK root count in 𝐂ⁿ
inferredcites →https://doi.org/10.1137/0731049openalex-snapshot
Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems

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.1996.0010openalex-snapshot
On the Complexity of Sparse Elimination
inferred← citeshttps://doi.org/10.1006/jcom.2000.0554openalex-snapshot
Numerical Homotopies to Compute Generic Points on Positive Dimensional Algebraic Sets
inferred← citeshttps://doi.org/10.1006/jsco.1998.0266openalex-snapshot
Matrices in Elimination Theory
inferred← citeshttps://doi.org/10.1006/jsco.1998.0271openalex-snapshot
Solving Degenerate Sparse Polynomial Systems Faster
inferred← citeshttps://doi.org/10.1006/jsco.1998.0272openalex-snapshot
Finding All Isolated Zeros of Polynomial Systems inCnvia Stable Mixed Volumes
inferred← citeshttps://doi.org/10.1006/jsco.2000.0392openalex-snapshot
A Systematic Framework for Solving Geometric Constraints Analytically
inferred← citeshttps://doi.org/10.1007/0-387-28814-7_1openalex-snapshot
Numerical Computations
inferred← citeshttps://doi.org/10.1007/3-540-27357-3_8openalex-snapshot
Introduction to numerical algebraic geometry
inferred← citeshttps://doi.org/10.1007/978-3-031-38659-6_8openalex-snapshot
Polynomial Equations: Theory and Practice
inferred← citeshttps://doi.org/10.1007/978-3-319-96418-8_13openalex-snapshot
libtropicon: A Scalable Library for Computing Intersection Points of Generic Tropical Hyper-surfaces
inferred← citeshttps://doi.org/10.1007/978-3-319-99957-9_12openalex-snapshot
Early Ending in Homotopy Path-Tracking for Real Roots
inferred← citeshttps://doi.org/10.1007/978-3-662-05148-1_4openalex-snapshot
Discrete Geometry for Algebraic Elimination
inferred← citeshttps://doi.org/10.1007/978-3-7643-7984-1_15openalex-snapshot
Proposal for the Algorithmic Use of the BKK-Number in the Algebraic Reduction of a O-dimensional Polynomial System
inferred← citeshttps://doi.org/10.1007/bf03025343openalex-snapshot
Multivariate descartes rule of signs and sturmfels’s challenge problem
inferred← citeshttps://doi.org/10.1007/s00200-025-00721-6openalex-snapshot
Sparse systems and algorithmic equidimensional decomposition
inferred← citeshttps://doi.org/10.1007/s00454-014-9571-zopenalex-snapshot
Elimination for Generic Sparse Polynomial Systems
inferred← citeshttps://doi.org/10.1007/s00454-018-0025-xopenalex-snapshot
On the Multiplicity of Isolated Roots of Sparse Polynomial Systems
inferred← citeshttps://doi.org/10.1007/s00454-019-00078-xopenalex-snapshot
Unmixing the Mixed Volume Computation
inferred← citeshttps://doi.org/10.1007/s10208-008-9024-2openalex-snapshot
Deformation Techniques for Sparse Systems
inferred← citeshttps://doi.org/10.1007/s11424-017-5214-9openalex-snapshot
Efficiently counting affine roots of mixed trigonometric polynomial systems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.04.004openalex-snapshot
Mixed volume techniques for embeddings of Laman graphs
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.jco.2006.04.004openalex-snapshot
Counting solutions to binomial complete intersections
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.02.002openalex-snapshot
Rational Univariate Reduction via toric resultants
inferred← citeshttps://doi.org/10.1016/j.jsc.2012.03.006openalex-snapshot
Affine solution sets of sparse polynomial systems
inferred← citeshttps://doi.org/10.1016/j.jsc.2016.07.015openalex-snapshot
What is numerical algebraic geometry?
inferred← citeshttps://doi.org/10.1016/j.jsc.2025.102528openalex-snapshot
Wronski pairs of honeycomb curves
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.07.015openalex-snapshot
Computing isolated roots of sparse polynomial systems in affine space
inferred← citeshttps://doi.org/10.1016/s0022-4049(98)00023-1openalex-snapshot
Toric intersection theory for affine root counting
inferred← citeshttps://doi.org/10.1016/s0096-3003(02)00540-4openalex-snapshot
Heuristic methods for computing the minimal multi-homogeneous Bézout number
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00003-7openalex-snapshot
How to count efficiently all affine roots of a polynomial system
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00049-9openalex-snapshot
Enumerating a subset of the integer points inside a Minkowski sum
inferred← citeshttps://doi.org/10.1016/s1570-8659(02)11004-0openalex-snapshot
Numerical Solution of Polynomial Systems by Homotopy Continuation Methods
inferred← citeshttps://doi.org/10.1017/s0962492900002749openalex-snapshot
Numerical solution of multivariate polynomial systems by homotopy continuation methods
inferred← citeshttps://doi.org/10.1023/a:1008348724781openalex-snapshot
Algebraic Geometry and Computer Vision: Polynomial Systems, Real and Complex Roots
inferred← citeshttps://doi.org/10.1023/a:1019163811284openalex-snapshot
Polyhedral end games for polynomial continuation
inferred← citeshttps://doi.org/10.1090/pspum/111/02040openalex-snapshot
The nonlinear algebra view of discrete mathematics
inferred← citeshttps://doi.org/10.1090/s0002-9947-07-04054-8openalex-snapshot
Mixed multiplicities of ideals versus mixed volumes of polytopes
inferred← citeshttps://doi.org/10.1090/s0025-5718-00-01303-xopenalex-snapshot
Minimizing multi-homogeneous Bézout numbers by a local search method
inferred← citeshttps://doi.org/10.1109/allerton.2019.8919934openalex-snapshot
Three Formulations of the Kuramoto Model as a System of Polynomial Equations
inferred← citeshttps://doi.org/10.1109/cssr.2010.5773883openalex-snapshot
The mechanization of multires algorithm and computation of mixed volume using mixed subdivision for sparse resultants
inferred← citeshttps://doi.org/10.1109/tit.2014.2368984openalex-snapshot
Interference Alignment Using Finite and Dependent Channel Extensions: The Single Beam Case
inferred← citeshttps://doi.org/10.1109/tpwrs.2017.2724030openalex-snapshot
On the Network Topology Dependent Solution Count of the Algebraic Load Flow Equations
inferred← citeshttps://doi.org/10.1137/070681740openalex-snapshot
A Hybrid Polynomial System Solving Method for Mixed Trigonometric Polynomial Systems
inferred← citeshttps://doi.org/10.1137/120890533openalex-snapshot
Counting Critical Formations on a Line
inferred← citeshttps://doi.org/10.1145/317275.317286openalex-snapshot
Algorithm 795
inferred← citeshttps://doi.org/10.11650/twjm/1500407124openalex-snapshot
SOLVING POLYNOMIAL SYSTEMS BY POLYHEDRAL HOMOTOPIES
inferred← citeshttps://doi.org/10.1177/0954406219898239openalex-snapshot
A frame-independent comparison metric for discrete motion sequences
inferred← citeshttps://doi.org/10.4310/cis.2015.v15.n2.a1openalex-snapshot
Homotopy continuation method for solving systems of nonlinear and polynomial equations
inferred← citeshttps://doi.org/10.48550/arxiv.1310.4128openalex-snapshot
A Polyhedral Method to Compute All Affine Solution Sets of Sparse Polynomial Systems
inferred← citeshttps://doi.org/10.48550/arxiv.math/9907060openalex-snapshot
Polynomial Homotopies for Dense, Sparse and Determinantal Systems
inferred← citeshttps://doi.org/10.5539/jmr.v4n6p65openalex-snapshot
Cylinders Through Five Points: Computational Algebra and Geometry
inferred← citeshttps://doi.org/10.70675/d0b760d0z6de6z48cazb255zb7c4e16724ecopenalex-snapshot
Homotopy algorithms for solving structured determinantal systems
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.