On the public citation graph

Factorization of polynomials over a finite field and the solution of systems of algebraic equations

https://doi.org/10.1007/bf01095638
0 signed · 44 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.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/bf01095643openalex-snapshot
Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
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/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.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-99639-4_13openalex-snapshot
Orthogonal Tropical Linear Prevarieties
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/bf01095637openalex-snapshot
Estimates of real roots of a system of algebraic equations
inferred← citeshttps://doi.org/10.1007/bf01095643openalex-snapshot
Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
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/s00200-019-00407-wopenalex-snapshot
Complexity of deciding whether a tropical linear prevariety is a tropical variety
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/s10958-006-0109-7openalex-snapshot
Complexity bound for the absolute factorization of parametric polynomials
inferred← citeshttps://doi.org/10.1007/s10958-011-0616-zopenalex-snapshot
Complexity of solving parametric polynomial systems
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/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/s0304-3975(97)80001-1openalex-snapshot
Univariate polynomial factorization over finite fields
inferred← citeshttps://doi.org/10.1109/18.782097openalex-snapshot
Improved decoding of Reed-Solomon and algebraic-geometry codes
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267801openalex-snapshot
Reconstructing algebraic functions from mixed data
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548470openalex-snapshot
Solving systems of polynomial congruences modulo a large prime
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743426openalex-snapshot
Improved decoding of Reed-Solomon and algebraic-geometric codes
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959879openalex-snapshot
Coding theory: Tutorial & survey
inferred← citeshttps://doi.org/10.1137/s0097539791194069openalex-snapshot
Computational Complexity of Sparse Rational Interpolation
inferred← citeshttps://doi.org/10.1145/309831.309843openalex-snapshot
A new algorithm for the geometric decomposition of a variety
inferred← citeshttps://doi.org/10.1145/337244.337247openalex-snapshot
A subdivision-based algorithm for the sparse resultant
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.56947/gjom.v4i4.278openalex-snapshot
Pade approximants and key lattices for decoding alternant codes
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.