On the public citation graph

Factoring multivariate polynomials over algebraic number fields

https://doi.org/10.1007/bfb0030321
0 signed · 24 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-11607-9_4openalex-snapshot
Lattices and factorization of polynomials over algebraic number fields
inferredcites →https://doi.org/10.1007/3-540-12868-9_108openalex-snapshot
Factoring polynomials over algebraic number fields
inferredcites →https://doi.org/10.1007/978-3-662-06865-6openalex-snapshot
Einführung in die Numerische Mathematik I
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bfb0036929openalex-snapshot
Factoring multivariate integral polynomials
inferredcites →https://doi.org/10.1016/0022-0000(85)90016-9openalex-snapshot
Factoring multivariate polynomials over finite fields
inferredcites →https://doi.org/10.1017/s0025557200071461openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0276200-xopenalex-snapshot
Factoring polynomials over large finite fields
inferredcites →https://doi.org/10.1090/s0025-5718-1974-0354624-3openalex-snapshot
An Inequality About Factors of Polynomials
inferredcites →https://doi.org/10.1090/s0025-5718-1976-0568283-xopenalex-snapshot
Factoring Multivariate Polynomials over Algebraic Number Fields
inferredcites →https://doi.org/10.1145/355705.355709openalex-snapshot
Factoring Polynomials Over Algebraic Number Fields
inferredcites →https://doi.org/10.1145/355791.355795openalex-snapshot
The Subresultant PRS Algorithm

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bf01098273openalex-snapshot
Solving systems of polynomial inequalities over a real closed field in subexponential time
inferred← citeshttps://doi.org/10.1007/bf01098275openalex-snapshot
Complexity of deciding the first-order theory of real closed fields
inferred← citeshttps://doi.org/10.1007/bf03167201openalex-snapshot
A unified method for multivariate polynomial factorizations
inferred← citeshttps://doi.org/10.1007/bfb0030285openalex-snapshot
Mathematical Foundations of Computer Science 1984
inferred← citeshttps://doi.org/10.1016/0022-0000(85)90043-1openalex-snapshot
Irreducibility of multivariate polynomials
inferred← citeshttps://doi.org/10.1016/0022-0000(85)90044-3openalex-snapshot
Factoring sparse multivariate polynomials
inferred← citeshttps://doi.org/10.1016/s0747-7171(88)80005-1openalex-snapshot
Solving systems of polynomial inequalities in subexponential time
inferred← citeshttps://doi.org/10.1016/s0747-7171(88)80006-3openalex-snapshot
Complexity of deciding Tarski algebra
inferred← citeshttps://doi.org/10.1090/s0025-5718-02-01428-xopenalex-snapshot
Factoring multivariate polynomials via partial differential equations
inferred← citeshttps://doi.org/10.1090/s0025-5718-76-99658-7openalex-snapshot
Indices
inferred← citeshttps://doi.org/10.3934/amc.2015.9.311openalex-snapshot
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
inferred← citeshttps://doi.org/10.70675/bea456b8zac03z4558zac15zf57721c51b80openalex-snapshot
Calcul effectif de la cohomologie des faisceaux constructibles sur le site étale d'une courbe
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.