On the public citation graph
Polynomial-time factorization of multivariate polynomials over finite fields
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.
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/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1016/0304-3975(83)90108-1openalex-snapshot
On the complexity of multiplication in 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-1981-0606517-5openalex-snapshot
A New Algorithm for Factoring Polynomials Over Finite Fields
inferredcites →https://doi.org/10.1090/s0025-5718-1984-0736459-9openalex-snapshot
Hensel and Newton Methods in Valuation Rings
inferredcites →https://doi.org/10.1109/sfcs.1981.37openalex-snapshot
Probabilistic algorithms in finite fields
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.1109/sfcs.1983.15openalex-snapshot
Factoring sparse multivariate polynomials
inferredcites →https://doi.org/10.1137/0209024openalex-snapshot
Probabilistic Algorithms in Finite Fields
inferredcites →https://doi.org/10.1137/0213050openalex-snapshot
Parallel Algorithms for Algebraic Problems
inferredcites →https://doi.org/10.1145/321662.321664openalex-snapshot
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
inferredcites →https://doi.org/10.1145/800061.808728openalex-snapshot
Parallel algorithms for algebraic problems
inferredcites →https://doi.org/10.1145/800061.808748openalex-snapshot
Factoring multivariate polynomials over finite fields
inferredcites →https://doi.org/10.1145/800070.802200openalex-snapshot
A polynomial reduction from multivariate to bivariate integral polynomial factorization.
inferredcites →https://doi.org/10.1145/800206.806396openalex-snapshot
Factorization over finitely generated fields
inferredcites →https://doi.org/10.1515/crll.1846.31.269openalex-snapshot
Grundzüge einer allgemeinen Theorie der höhern Congruenzen, deren Modul eine reelle Primzahl ist.
inferredcites →https://doi.org/10.2307/2311171openalex-snapshot
An Introduction to the Theory of Numbers.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-63163-1_2openalex-snapshot
Efficient multivariate factorization over finite fields
inferred← citeshttps://doi.org/10.1007/bf03167201openalex-snapshot
A unified method for multivariate polynomial factorizations
inferred← citeshttps://doi.org/10.1007/bfb0036892openalex-snapshot
Automata, Languages and Programming
inferred← citeshttps://doi.org/10.1016/0022-0000(85)90016-9openalex-snapshot
Factoring multivariate polynomials over finite fields
inferred← citeshttps://doi.org/10.1016/0196-6774(84)90022-1openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/s0747-7171(85)80029-8openalex-snapshot
Fast parallel absolute irreducibility testing
inferred← citeshttps://doi.org/10.1090/s0025-5718-1984-0736459-9openalex-snapshot
Hensel and Newton Methods in Valuation Rings
inferred← citeshttps://doi.org/10.1109/sfcs.1983.15openalex-snapshot
Factoring sparse multivariate polynomials
inferred← citeshttps://doi.org/10.1137/0213050openalex-snapshot
Parallel Algorithms for Algebraic Problems
inferred← citeshttps://doi.org/10.1137/0214035openalex-snapshot
Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
inferred← citeshttps://doi.org/10.3929/ethz-a-003828824openalex-snapshot
Factorization of multivariate polynomials over finite 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.