On the public citation graph

Polynomial factorization by root approximation

https://doi.org/10.1007/bfb0032849
0 signed · 16 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-13345-3_40openalex-snapshot
Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1090/s0025-5718-1974-0354624-3openalex-snapshot
An Inequality About Factors of Polynomials

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.2000.0572openalex-snapshot
Kronecker's and Newton's Approaches to Solving: A First Comparison
inferred← citeshttps://doi.org/10.1007/11615798_6openalex-snapshot
Computing Curves Bounding Trigonometric Planar Maps: Symbolic and Hybrid Methods
inferred← citeshttps://doi.org/10.1007/3-540-13345-3_40openalex-snapshot
Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_7openalex-snapshot
Selected Applications of LLL in Number Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-77586-4_1openalex-snapshot
Integer Approximation to the Intersection of Three Planes with Planar Constraints
inferred← citeshttps://doi.org/10.1007/bf03167142openalex-snapshot
Approximate factorization of multivariate polynomials and absolute irreducibility testing
inferred← citeshttps://doi.org/10.1007/bf03167386openalex-snapshot
A study of approximate polynomials, I —Representation and arithmetic—
inferred← citeshttps://doi.org/10.1016/0022-0000(89)90046-9openalex-snapshot
On finite-precision representations of geometric objects
inferred← citeshttps://doi.org/10.1016/0893-9659(89)90022-0openalex-snapshot
Two design principles of geometric algorithms in finite-precision arithmetic
inferred← citeshttps://doi.org/10.1016/0893-9659(91)90124-eopenalex-snapshot
The distribution of the zeros generated by length-bounded polynomials
inferred← citeshttps://doi.org/10.1016/0898-1221(85)90094-xopenalex-snapshot
On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems
inferred← citeshttps://doi.org/10.1109/synasc.2010.76openalex-snapshot
Polynomial GCD and Factorization via Approximate Gröbner Bases
inferred← citeshttps://doi.org/10.48550/arxiv.math/9908082openalex-snapshot
Kronecker's and Newton's approaches to solving: A first comparison
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.