On the public citation graph
A unified method for multivariate polynomial factorizations
0 signed · 49 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/j.1538-7305.1967.tb03174.xopenalex-snapshot
Factoring Polynomials Over Finite Fields
inferredcites →https://doi.org/10.1007/3-540-10843-2_2openalex-snapshot
Absolute primality of polynomials is decidable in random polynomial time in the number of variables
inferredcites →https://doi.org/10.1007/3-540-11607-9_4openalex-snapshot
Lattices and factorization of polynomials over algebraic number fields
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf03167142openalex-snapshot
Approximate factorization of multivariate polynomials and absolute irreducibility testing
inferredcites →https://doi.org/10.1007/bf03167271openalex-snapshot
Analysis of approximate factorization algorithm I
inferredcites →https://doi.org/10.1007/bfb0030321openalex-snapshot
Factoring multivariate polynomials over algebraic number fields
inferredcites →https://doi.org/10.1007/bfb0036913openalex-snapshot
Polynomial-time factorization of multivariate polynomials over finite fields
inferredcites →https://doi.org/10.1016/0022-314x(69)90047-xopenalex-snapshot
On Hensel factorization, I
inferredcites →https://doi.org/10.1016/s0747-7171(85)80029-8openalex-snapshot
Fast parallel absolute irreducibility testing
inferredcites →https://doi.org/10.1090/s0025-5718-1975-0396471-3openalex-snapshot
Factoring multivariate polynomials over the integers
inferredcites →https://doi.org/10.1090/s0025-5718-1976-0568283-xopenalex-snapshot
Factoring Multivariate Polynomials over Algebraic Number Fields
inferredcites →https://doi.org/10.1137/0216040openalex-snapshot
Factoring Multivariate Polynomials over Algebraic Number Fields
inferredcites →https://doi.org/10.1145/1089310.1089311openalex-snapshot
Polynomial reduction from multivariate to bivariate integral polynomial factorization
inferredcites →https://doi.org/10.1145/355705.355709openalex-snapshot
Factoring Polynomials Over Algebraic Number Fields
inferredcites →https://doi.org/10.1145/800205.806338openalex-snapshot
Algebraic factoring and rational function integration
inferredcites →https://doi.org/10.1145/96877.96966openalex-snapshot
On factoring multi-variate polynomials over algebraically closed fields (abstract)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jnth.2001.2763openalex-snapshot
Factoring Polynomials and the Knapsack Problem
inferred← citeshttps://doi.org/10.1007/978-3-211-99314-9_5openalex-snapshot
Regularization and Matrix Computation in Numerical Polynomial Algebra
inferred← citeshttps://doi.org/10.1007/978-3-7643-7984-1_2openalex-snapshot
Ill-conditioned Properties and Hybrid Computations
inferred← citeshttps://doi.org/10.1007/bf03167329openalex-snapshot
Solving multivariate algebraic equation by Hensel construction
inferred← citeshttps://doi.org/10.1007/bf03167386openalex-snapshot
A study of approximate polynomials, I —Representation and arithmetic—
inferred← citeshttps://doi.org/10.1007/s11424-018-6445-0openalex-snapshot
A New Algorithm for Computing the Extended Hensel Construction of Multivariate Polynomials
inferred← citeshttps://doi.org/10.1007/s11425-014-4850-yopenalex-snapshot
Sparse bivariate polynomial factorization
inferred← citeshttps://doi.org/10.1016/j.jco.2007.01.008openalex-snapshot
Lifting and recombination techniques for absolute factorization
inferred← citeshttps://doi.org/10.1016/j.jco.2025.101934openalex-snapshot
Factoring sparse polynomials fast
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.11.047openalex-snapshot
Computing monodromy via continuation methods on random Riemann surfaces
inferred← citeshttps://doi.org/10.1023/a:1011188813541openalex-snapshot
Enclosure of the Zero Set of Polynomials in Several Complex Variables
inferred← citeshttps://doi.org/10.1090/s0025-5718-06-01810-2openalex-snapshot
Sharp precision in Hensel lifting for bivariate polynomial factorization
inferred← citeshttps://doi.org/10.1137/s0036142901397101openalex-snapshot
Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
inferred← citeshttps://doi.org/10.1145/1005285.1005294openalex-snapshot
Complexity issues in bivariate polynomial factorization
inferred← citeshttps://doi.org/10.1145/1080368.1080370openalex-snapshot
Factorization of multivariate polynomials by extended Hensel construction
inferred← citeshttps://doi.org/10.1145/1277500.1277502openalex-snapshot
Approximate bivariate factorization
inferred← citeshttps://doi.org/10.1145/1577190.1577210openalex-snapshot
Continuations and monodromy on random riemann surfaces
inferred← citeshttps://doi.org/10.1145/1577190.1577216openalex-snapshot
Approximate factorization of polynomials over Z
inferred← citeshttps://doi.org/10.1145/1823931.1823948openalex-snapshot
Approximate factorization of polynomials in Z[x]
inferred← citeshttps://doi.org/10.1145/3510359openalex-snapshot
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
inferred← citeshttps://doi.org/10.1145/384101.384114openalex-snapshot
Towards factoring bivariate approximate polynomials
inferred← citeshttps://doi.org/10.1145/780506.780531openalex-snapshot
Towards certified irreducibility testing of bivariate approximate polynomials
inferred← citeshttps://doi.org/10.11540/jsiamt.7.2_217openalex-snapshot
近似スペクトル分解とその最適制御への応用:SISO, 1パラメータの場合
inferred← citeshttps://doi.org/10.1504/ijcse.2009.027001openalex-snapshot
Decomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm
inferred← citeshttps://doi.org/10.4271/940203openalex-snapshot
Joining of Si 3 N 4 Turbine Rotor and Metal Shaft
inferred← citeshttps://doi.org/10.48550/arxiv.2312.17380openalex-snapshot
Factoring sparse polynomials fast
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0509067openalex-snapshot
Decomposing Solution Sets of Polynomial Systems: A New Parallel Monodromy Breakup Algorithm
inferred← citeshttps://doi.org/10.5802/ccirm.18openalex-snapshot
Factorisation des polynômes à plusieurs variables
inferred← citeshttps://doi.org/10.5802/jtnb.655openalex-snapshot
Factoring polynomials over global fields
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.