On the public citation graph

Analysis of approximate factorization algorithm I

https://doi.org/10.1007/bf03167271
0 signed · 35 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/978-94-009-5225-6openalex-snapshot
Multidimensional Systems Theory
inferredcites →https://doi.org/10.1007/bf01708057openalex-snapshot
Moderne Algebra
inferredcites →https://doi.org/10.1007/bf03167142openalex-snapshot
Approximate factorization of multivariate polynomials and absolute irreducibility testing

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

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-319-02297-0_26openalex-snapshot
Towards Industrial Application of Approximate Computer Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-57201-2_27openalex-snapshot
Condition Analysis of Overdetermined Algebraic Problems
inferred← citeshttps://doi.org/10.1007/bf03167201openalex-snapshot
A unified method for multivariate polynomial factorizations
inferred← citeshttps://doi.org/10.1007/bf03167386openalex-snapshot
A study of approximate polynomials, I —Representation and arithmetic—
inferred← citeshttps://doi.org/10.1007/s11424-011-8312-0openalex-snapshot
Obtaining exact interpolation multivariate polynomial by approximation
inferred← citeshttps://doi.org/10.1007/s11424-014-2170-5openalex-snapshot
Exact bivariate polynomial factorization over ℚ by approximation of roots
inferred← citeshttps://doi.org/10.1007/s11425-007-0092-6openalex-snapshot
Obtaining exact value by approximate computations
inferred← citeshttps://doi.org/10.1007/s11425-014-4850-yopenalex-snapshot
Sparse bivariate polynomial factorization
inferred← citeshttps://doi.org/10.1016/j.jsc.2007.11.005openalex-snapshot
Approximate factorization of multivariate polynomials using singular value decomposition
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.1090/s0025-5718-06-01810-2openalex-snapshot
Sharp precision in Hensel lifting for bivariate polynomial factorization
inferred← citeshttps://doi.org/10.1090/s0025-5718-96-00702-8openalex-snapshot
The integer Chebyshev problem
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/1005285.1005311openalex-snapshot
Approximate factorization of multivariate polynomials via differential equations
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/281508.281521openalex-snapshot
An analysis of cancellation error in multivariate Hensel construction with floating-point number arithmetic
inferred← citeshttps://doi.org/10.1145/345542.345616openalex-snapshot
Pseudofactors of multivariate polynomials
inferred← citeshttps://doi.org/10.1145/384101.384114openalex-snapshot
Towards factoring bivariate approximate polynomials
inferred← citeshttps://doi.org/10.1145/384101.384139openalex-snapshot
Approximate multivariate polynomial factorization based on zero-sum relations
inferred← citeshttps://doi.org/10.1145/780506.780531openalex-snapshot
Towards certified irreducibility testing of bivariate approximate polynomials
inferred← citeshttps://doi.org/10.1145/860854.860893openalex-snapshot
On approximate irreducibility of polynomials in several variables
inferred← citeshttps://doi.org/10.1201/b15006openalex-snapshot
Handbook of Finite Fields
inferred← citeshttps://doi.org/10.1201/b15006-22openalex-snapshot
Cryptography
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.48550/arxiv.1008.3596openalex-snapshot
Exact Bivariate Polynomial Factorization in Q by Approximation of Roots
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.48550/arxiv.math/0701670openalex-snapshot
Multivariate Polynomial Factorization by Interpolation Method
inferred← citeshttps://doi.org/10.48550/arxiv.math/0701672openalex-snapshot
An Improved Algorithm for Recovering Exact Value from its Approximation
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.