On the public citation graph
Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
0 signed · 78 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-10856-4_94openalex-snapshot
Multiplicative complexity of a bilinear form over a commutative ring
inferredcites →https://doi.org/10.1007/3-540-11607-9_5openalex-snapshot
Commutative algebra and computer algebra
inferredcites →https://doi.org/10.1007/bf01095638openalex-snapshot
Factorization of polynomials over a finite field and the solution of systems of algebraic equations
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf01465456openalex-snapshot
Relation between rank and multiplicative complexity of a bilinear form over a commutative Noetherian ring
inferredcites →https://doi.org/10.1007/bf01629437openalex-snapshot
Two reductions of graph isomorphism to problems on polynomials
inferredcites →https://doi.org/10.1016/0304-3975(81)90064-5openalex-snapshot
Resolution des systemes d'equations algebriques
inferredcites →https://doi.org/10.1109/sfcs.1982.56openalex-snapshot
A polynomial-time reduction from bivariate to univariate integral polynomial factorization
inferredcites →https://doi.org/10.1145/321371.321381openalex-snapshot
Subresultants and Reduced Polynomial Remainder Sequences
inferredcites →https://doi.org/10.1145/321784.321787openalex-snapshot
The Exact Solution of Systems of Linear Equations with Polynomial Coefficients
inferredcites →https://doi.org/10.1145/800070.802200openalex-snapshot
A polynomial reduction from multivariate to bivariate integral polynomial factorization.
inferredcites →https://doi.org/10.2307/2373905openalex-snapshot
Constructions in a Polynomial Ring Over the Ring of Integers
inferredcites →https://doi.org/10.24033/bsmf.1848openalex-snapshot
Algèbre linéaire sur $K[X_1,\dots,X_n]$ et élimination
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1998.2771openalex-snapshot
Sentences over Integral Domains and Their Computational Complexities
inferred← citeshttps://doi.org/10.1006/jagm.2000.1098openalex-snapshot
Extended Hilbert Irreducibility and Its Applications
inferred← citeshttps://doi.org/10.1006/jcom.1995.1007openalex-snapshot
Complexity of Finding Irreducible Components of a Semialgebraic Set
inferred← citeshttps://doi.org/10.1006/jcom.1999.0536openalex-snapshot
The Complexity of Local Dimensions for Constructible Sets
inferred← citeshttps://doi.org/10.1006/jsco.1998.0236openalex-snapshot
Computing the Isolated Roots by Matrix Methods
inferred← citeshttps://doi.org/10.1006/jsco.1998.0266openalex-snapshot
Matrices in Elimination Theory
inferred← citeshttps://doi.org/10.1006/jsco.1999.0304openalex-snapshot
Generalized Resultants over Unirational Algebraic Varieties
inferred← citeshttps://doi.org/10.1006/jsco.2001.0505openalex-snapshot
Approximate Solutions of Polynomial Equations
inferred← citeshttps://doi.org/10.1007/3-540-27357-3_3openalex-snapshot
Symbolic-numeric methods for solving polynomial equations and applications
inferred← citeshttps://doi.org/10.1007/978-3-0348-8560-7_2openalex-snapshot
Integral Formulas in Several Variables
inferred← citeshttps://doi.org/10.1007/978-3-319-02297-0_11openalex-snapshot
Polynomial Complexity of Solving Systems of Few Algebraic Equations with Small Degrees
inferred← citeshttps://doi.org/10.1007/978-3-319-24021-3_11openalex-snapshot
Polynomial Complexity Recognizing a Tropical Linear Variety
inferred← citeshttps://doi.org/10.1007/978-3-319-24021-3_12openalex-snapshot
Computing Highest-Order Divisors for a Class of Quasi-Linear Partial Differential Equations
inferred← citeshttps://doi.org/10.1007/978-3-319-70566-8_19openalex-snapshot
Factorization of ℤ$$ \mathbb {Z}$$-Homogeneous Polynomials in the First q-Weyl Algebra
inferred← citeshttps://doi.org/10.1007/978-3-319-99639-4_13openalex-snapshot
Orthogonal Tropical Linear Prevarieties
inferred← citeshttps://doi.org/10.1007/978-3-540-87827-8_21openalex-snapshot
A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals
inferred← citeshttps://doi.org/10.1007/978-3-642-32973-9_12openalex-snapshot
Complexity of Solving Systems with Few Independent Monomials and Applications to Mass-Action Kinetics
inferred← citeshttps://doi.org/10.1007/bf01095638openalex-snapshot
Factorization of polynomials over a finite field and the solution of systems of algebraic equations
inferred← citeshttps://doi.org/10.1007/bf01104104openalex-snapshot
Deciding consistency of systems of exponential-polynomial inequalities in subexponential time
inferred← citeshttps://doi.org/10.1007/bf01104109openalex-snapshot
Polynomial complexity algorithms for computational problems in the theory of algebraic curves
inferred← citeshttps://doi.org/10.1007/bf01159108openalex-snapshot
Complexity of computations in commutative division of the USSR Academy of Sciences
inferred← citeshttps://doi.org/10.1007/bf01202285openalex-snapshot
Finding irreducible components of some real transcendental varieties
inferred← citeshttps://doi.org/10.1007/bf02573959openalex-snapshot
Feasibility testing for systems of real quadratic equations
inferred← citeshttps://doi.org/10.1007/s00037-009-0283-3openalex-snapshot
Counting Irreducible Components of Complex Algebraic Varieties
inferred← citeshttps://doi.org/10.1007/s000370050029openalex-snapshot
Solvability of systems of polynomial congruences modulo a large prime
inferred← citeshttps://doi.org/10.1007/s00200-019-00407-wopenalex-snapshot
Complexity of deciding whether a tropical linear prevariety is a tropical variety
inferred← citeshttps://doi.org/10.1007/s002090100287openalex-snapshot
The complexification and degree of a semi-algebraic set
inferred← citeshttps://doi.org/10.1007/s00454-016-9839-6openalex-snapshot
Bounds on the Number of Connected Components for Tropical Prevarieties
inferred← citeshttps://doi.org/10.1007/s00607-010-0099-7openalex-snapshot
On computing absolutely irreducible components of algebraic varieties with parameters
inferred← citeshttps://doi.org/10.1007/s10703-024-00444-3openalex-snapshot
Porous invariants for linear systems
inferred← citeshttps://doi.org/10.1007/s10958-006-0109-7openalex-snapshot
Complexity bound for the absolute factorization of parametric polynomials
inferred← citeshttps://doi.org/10.1007/s10958-009-9413-3openalex-snapshot
Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV
inferred← citeshttps://doi.org/10.1007/s10958-011-0616-zopenalex-snapshot
Complexity of solving parametric polynomial systems
inferred← citeshttps://doi.org/10.1007/s10958-013-1655-4openalex-snapshot
A Deterministic Polynomial-Time Algorithm for the First Bertini Theorem. I
inferred← citeshttps://doi.org/10.1007/s10958-014-1968-yopenalex-snapshot
A Deterministic Polynomial-Time Algorithm for the First Bertini Theorem. II
inferred← citeshttps://doi.org/10.1007/s10958-015-2543-xopenalex-snapshot
A Deterministic Polynomial-Time Algorithm for the First Bertini Theorem. III
inferred← citeshttps://doi.org/10.1007/s10958-018-3868-zopenalex-snapshot
Systems with Parameters, or Efficiently Solving Systems of Polynomial Equations: 33 Years Later. I
inferred← citeshttps://doi.org/10.1007/s10958-019-04378-8openalex-snapshot
Systems with Parameters, or Efficiently Solving Systems of Polynomial Equations 33 Years Later. II
inferred← citeshttps://doi.org/10.1007/s11786-020-00479-9openalex-snapshot
Efficiently and Effectively Recognizing Toricity of Steady State Varieties
inferred← citeshttps://doi.org/10.1016/0168-0072(90)90069-eopenalex-snapshot
Algorithms for sentences over integral domains
inferred← citeshttps://doi.org/10.1016/j.aam.2010.03.006openalex-snapshot
On factoring parametric multivariate polynomials
inferred← citeshttps://doi.org/10.1016/j.ic.2008.04.001openalex-snapshot
Computational complexity of sentences over fields
inferred← citeshttps://doi.org/10.1016/j.jsc.2009.04.002openalex-snapshot
Algorithms for near solutions to polynomial equations
inferred← citeshttps://doi.org/10.1016/s0022-4049(97)00009-1openalex-snapshot
Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic
inferred← citeshttps://doi.org/10.1090/s1061-0022-09-01081-4openalex-snapshot
Double-exponential lower bound for the degree of any system of generators of a polynomial prime ideal
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548470openalex-snapshot
Solving systems of polynomial congruences modulo a large prime
inferred← citeshttps://doi.org/10.1137/s0097539791194069openalex-snapshot
Computational Complexity of Sparse Rational Interpolation
inferred← citeshttps://doi.org/10.1137/s0097539793258313openalex-snapshot
Computing the Additive Complexity of Algebraic Circuits with Root Extracting
inferred← citeshttps://doi.org/10.1142/s021819672350039xopenalex-snapshot
The isomorphism problem of projective schemes and related algorithmic problems
inferred← citeshttps://doi.org/10.1145/1277548.1277558openalex-snapshot
Differential forms in computational algebraic geometry
inferred← citeshttps://doi.org/10.1145/236869.236891openalex-snapshot
Computing the complexification of a semi-algebraic set
inferred← citeshttps://doi.org/10.1145/276698.276863openalex-snapshot
A black box approach to the algebraic set decomposition problem
inferred← citeshttps://doi.org/10.1145/337244.337247openalex-snapshot
A subdivision-based algorithm for the sparse resultant
inferred← citeshttps://doi.org/10.1145/345542.345609openalex-snapshot
Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
inferred← citeshttps://doi.org/10.1145/3717823.3718167openalex-snapshot
Primes via Zeros: Interactive Proofs for Testing Primality of Natural Classes of Ideals
inferred← citeshttps://doi.org/10.1145/73007.73020openalex-snapshot
Quantifier elimination in the theory of an algebraically-closed field
inferred← citeshttps://doi.org/10.22436/jnsa.005.06.03openalex-snapshot
An algorithm for solving zero-dimensional parametric systems of polynomial homogeneous equations
inferred← citeshttps://doi.org/10.2307/2274469openalex-snapshot
Decidable fragments of field theories
inferred← citeshttps://doi.org/10.48550/arxiv.0705.2127openalex-snapshot
On the complexity of solving ordinary differential equations in terms of Puiseux series
inferred← citeshttps://doi.org/10.48550/arxiv.0802.2625openalex-snapshot
A note on the computation of Puiseux series solutions of the Riccatti equation associated with a homogeneous linear ordinary differential equation
inferred← citeshttps://doi.org/10.48550/arxiv.1511.06609openalex-snapshot
Bounds on the number of connected components for tropical prevarieties
inferred← citeshttps://doi.org/10.5565/publmat_42198_06openalex-snapshot
Solving quadratic equations over polynomial rings of characteristic two
inferred← citeshttps://doi.org/10.5802/jtnb.1124openalex-snapshot
Computation of étale cohomology on curves in single exponential time
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.