On the public citation graph
Polynomial factorization 1987–1991
0 signed · 197 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.1006/jsco.1993.1027openalex-snapshot
Factorization of Multivariate Polynomials with Coefficients in Fp
inferredcites →https://doi.org/10.1007/3-540-09519-5_73openalex-snapshot
Probabilistic algorithms for sparse polynomials
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-12868-9_108openalex-snapshot
Factoring polynomials over algebraic number fields
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/3-540-51082-6_79openalex-snapshot
Newton symmetric functions and the arithmetic of algebraically closed fields
inferredcites →https://doi.org/10.1007/3-540-51084-2_24openalex-snapshot
Some computational aspects of root finding in GF(qm)
inferredcites →https://doi.org/10.1007/3-540-51084-2_44openalex-snapshot
Improved sparse multivariate polynomial interpolation algorithms
inferredcites →https://doi.org/10.1007/3-540-51084-2_45openalex-snapshot
Heuristic methods for operations with algebraic numbers
inferredcites →https://doi.org/10.1007/978-1-4757-4158-2_8openalex-snapshot
Explicit Construction of the Hilbert Class Fields of Imaginary Quadratic Fields by Integer Lattice Reduction
inferredcites →https://doi.org/10.1007/978-3-642-52605-3_4openalex-snapshot
Ein algebraisches Kriterium für absolute Irreduzibilität
inferredcites →https://doi.org/10.1007/978-3-7091-3406-1_12openalex-snapshot
Computing in Algebraic Extensions
inferredcites →https://doi.org/10.1007/978-3-7091-3406-1_8openalex-snapshot
Factorization of Polynomials
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_4openalex-snapshot
Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition
inferredcites →https://doi.org/10.1007/bf01272074openalex-snapshot
Computing Frobenius maps and factoring polynomials
inferredcites →https://doi.org/10.1007/bf01449599openalex-snapshot
Ein algebraisches Kriterium f�r absolute Irreduzibilit�t
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf01782374openalex-snapshot
Eine Bemerkung über die Unzerlegbarkeit von Polynomen
inferredcites →https://doi.org/10.1007/bf01810297openalex-snapshot
Computing the irreducible real factors and components of an algebraic curve
inferredcites →https://doi.org/10.1007/bf02162564openalex-snapshot
Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
inferredcites →https://doi.org/10.1007/bfb0080437openalex-snapshot
Equations over Finite Fields An Elementary Approach
inferredcites →https://doi.org/10.1016/0004-3702(76)90005-9openalex-snapshot
A new approach to the symbolic factorization of multivariate polynomials
inferredcites →https://doi.org/10.1016/0020-0190(84)90018-8openalex-snapshot
On computing the determinant in small parallel time using a small number of processors
inferredcites →https://doi.org/10.1016/0020-0190(90)90195-4openalex-snapshot
On the deterministic complexity of factoring polynomials over finite fields
inferredcites →https://doi.org/10.1016/0020-0190(91)90212-zopenalex-snapshot
Smoothness and factoring polynomials over finite fields
inferredcites →https://doi.org/10.1016/0022-0000(85)90013-3openalex-snapshot
Solvability by radicals is in polynomial time
inferredcites →https://doi.org/10.1016/0022-0000(85)90043-1openalex-snapshot
Irreducibility of multivariate polynomials
inferredcites →https://doi.org/10.1016/0022-314x(69)90047-xopenalex-snapshot
On Hensel factorization, I
inferredcites →https://doi.org/10.1016/0167-8396(88)90011-8openalex-snapshot
Automatic parameterization of rational curves and surfaces III: Algebraic plane curves
inferredcites →https://doi.org/10.1016/0196-6774(91)90014-popenalex-snapshot
Generalized riemann hypothesis and factoring polynomials over finite fields
inferredcites →https://doi.org/10.1016/0196-6774(91)90015-qopenalex-snapshot
Factorization of polynomials over finite fields and decomposition of primes in algebraic number fields
inferredcites →https://doi.org/10.1016/0304-3975(87)90081-8openalex-snapshot
Factoring polynomials and primitive elements for special primes
inferredcites →https://doi.org/10.1016/0747-7171(92)90005-oopenalex-snapshot
A heuristic irreducibility test for univariate polynomials
inferredcites →https://doi.org/10.1016/0885-064x(90)90032-9openalex-snapshot
Simple algorithms for approximating all roots of a polynomial with real roots
inferredcites →https://doi.org/10.1016/b978-0-12-587260-7.50007-8openalex-snapshot
Infallible Calculation of Polynomial Zeros to Specified Precision
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50016-3openalex-snapshot
Algebraic Complexity Theory
inferredcites →https://doi.org/10.1016/s0019-9958(85)80041-3openalex-snapshot
A taxonomy of problems with fast parallel algorithms
inferredcites →https://doi.org/10.1016/s0019-9958(85)80056-5openalex-snapshot
Effective Hilbert irreducibility
inferredcites →https://doi.org/10.1016/s0022-0000(77)80013-5openalex-snapshot
Sparse complex polynomials and polynomial reducibility
inferredcites →https://doi.org/10.1016/s0304-0208(08)73491-1openalex-snapshot
Un Algorithme De Construction Des Idempotents Primitifs D'Ideaux D'Algebres Sur Fq
inferredcites →https://doi.org/10.1016/s0747-7171(08)80011-9openalex-snapshot
Factoring polynomials using fewer random bits
inferredcites →https://doi.org/10.1016/s0747-7171(08)80014-4openalex-snapshot
Functional decomposition ofpolynomials: the tame case
inferredcites →https://doi.org/10.1016/s0747-7171(08)80015-6openalex-snapshot
Computing with polynomials given byblack boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators
inferredcites →https://doi.org/10.1016/s0747-7171(08)80018-1openalex-snapshot
Interpolating polynomials from their values
inferredcites →https://doi.org/10.1016/s0747-7171(08)80054-5openalex-snapshot
Functional decomposition of polynomials: The wild case
inferredcites →https://doi.org/10.1016/s0747-7171(85)80029-8openalex-snapshot
Fast parallel absolute irreducibility testing
inferredcites →https://doi.org/10.1016/s0747-7171(87)80055-xopenalex-snapshot
Deterministic irreducibility testing of polynomials over large finite fields
inferredcites →https://doi.org/10.1016/s0747-7171(89)80027-6openalex-snapshot
Polynomial decomposition algorithms
inferredcites →https://doi.org/10.1080/02522667.1989.10698971openalex-snapshot
A Deterministic Algorithm for Factorizing Polynomials over Extensions GF(pm) of GF(p), p a Small Prime
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-1977-0422193-8openalex-snapshot
On the Efficiency of Algorithms for Polynomial Factoring
inferredcites →https://doi.org/10.1090/s0025-5718-1978-0568284-3openalex-snapshot
An Improved Multivariate Polynomial Factoring Algorithm
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-1983-0717715-6openalex-snapshot
Irreducibility testing and factorization of polynomials
inferredcites →https://doi.org/10.1090/s0025-5718-1984-0736459-9openalex-snapshot
Hensel and Newton Methods in Valuation Rings
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0771036-6openalex-snapshot
A Globally Convergent Method for Simultaneously Finding Polynomial Roots
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777280-6openalex-snapshot
Elliptic curves over finite fields and the computation of square roots mod 𝑝
inferredcites →https://doi.org/10.1090/s0025-5718-1988-0917831-4openalex-snapshot
Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers
inferredcites →https://doi.org/10.1090/s0025-5718-1990-0993933-0openalex-snapshot
New algorithms for finding irreducible polynomials over finite fields
inferredcites →https://doi.org/10.1093/qmath/5.1.102openalex-snapshot
ON THE REDUCTIBILITY OF POLYNOMIALS OVER A FINITE FIELD
inferredcites →https://doi.org/10.1093/qmath/7.1.110openalex-snapshot
ON THE REDUCTIBILITY OF POLYNOMIALS OVER A FINITE FIELD
inferredcites →https://doi.org/10.1098/rsta.1956.0003openalex-snapshot
Effective procedures in field theory
inferredcites →https://doi.org/10.1109/fscs.1990.89534openalex-snapshot
Specified precision polynomial root isolation is in NC
inferredcites →https://doi.org/10.1109/sfcs.1977.18openalex-snapshot
On taking roots in finite fields
inferredcites →https://doi.org/10.1109/sfcs.1981.37openalex-snapshot
Probabilistic algorithms in finite fields
inferredcites →https://doi.org/10.1109/sfcs.1989.63462openalex-snapshot
Galois groups and factoring polynomials over finite fields
inferredcites →https://doi.org/10.1109/sfcs.1989.63496openalex-snapshot
Simplification of nested radicals
inferredcites →https://doi.org/10.1109/tit.1986.1057137openalex-snapshot
Solving sparse linear equations over finite fields
inferredcites →https://doi.org/10.1137/0209024openalex-snapshot
Probabilistic Algorithms in Finite Fields
inferredcites →https://doi.org/10.1137/0212031openalex-snapshot
A Generalized Class of Polynomials that are Hard to Factor
inferredcites →https://doi.org/10.1137/0214015openalex-snapshot
Factoring Polynomials over Algebraic Number Fields
inferredcites →https://doi.org/10.1137/0214035openalex-snapshot
Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
inferredcites →https://doi.org/10.1137/0216040openalex-snapshot
Factoring Multivariate Polynomials over Algebraic Number Fields
inferredcites →https://doi.org/10.1137/0219073openalex-snapshot
Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
inferredcites →https://doi.org/10.1137/0220001openalex-snapshot
Absolute Factorization of Polynomials: A Geometric Approach
inferredcites →https://doi.org/10.1145/103418.103431openalex-snapshot
Effective Noether irreducibility forms and applications
inferredcites →https://doi.org/10.1145/1089302.1089307openalex-snapshot
Statistics on factoring polynomials mod p and p-adically
inferredcites →https://doi.org/10.1145/120694.120695openalex-snapshot
Rational function decomposition
inferredcites →https://doi.org/10.1145/120694.120697openalex-snapshot
A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic
inferredcites →https://doi.org/10.1145/120694.120698openalex-snapshot
Practical factorization of univariate polynomials over finite fields
inferredcites →https://doi.org/10.1145/120694.120699openalex-snapshot
Scratchpad's view of algebra II
inferredcites →https://doi.org/10.1145/129712.129722openalex-snapshot
Computing Frobenius maps and factoring polynomials
inferredcites →https://doi.org/10.1145/321879.321890openalex-snapshot
Multivariate Polynomial Factorization
inferredcites →https://doi.org/10.1145/322077.322084openalex-snapshot
A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
inferredcites →https://doi.org/10.1145/32439.32485openalex-snapshot
A fast implementation of polynomial factorization
inferredcites →https://doi.org/10.1145/32439.32490openalex-snapshot
The Bath algebraic number package
inferredcites →https://doi.org/10.1145/355705.355709openalex-snapshot
Factoring Polynomials Over Algebraic Number Fields
inferredcites →https://doi.org/10.1145/355705.355710openalex-snapshot
An Exact Method for Finding the Roots of a Complex Polynomial
inferredcites →https://doi.org/10.1145/42267.45069openalex-snapshot
Greatest common divisors of polynomials given by straight-line programs
inferredcites →https://doi.org/10.1145/62212.62241openalex-snapshot
A deterministic algorithm for sparse multivariate polynomial interpolation
inferredcites →https://doi.org/10.1145/74540.74551openalex-snapshot
Factoring rational polynomials over the complexes
inferredcites →https://doi.org/10.1145/74540.74555openalex-snapshot
Recovery of algebraic numbers from their p-adic approximations
inferredcites →https://doi.org/10.1145/800113.803645openalex-snapshot
Evaluation of polynomials with super-preconditioning
inferredcites →https://doi.org/10.1145/800205.806338openalex-snapshot
Algebraic factoring and rational function integration
inferredcites →https://doi.org/10.1145/800206.806372openalex-snapshot
Newton's iteration and the sparse Hensel algorithm (Extended Abstract)
inferredcites →https://doi.org/10.1145/800206.806379openalex-snapshot
Implementing a polynomial factorization and GCD package
inferredcites →https://doi.org/10.1145/96877.96912openalex-snapshot
Modular rational sparse multivariate polynomial interpolation
inferredcites →https://doi.org/10.1145/96877.96915openalex-snapshot
Parallel univariate polynomial factorization on shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/96877.96966openalex-snapshot
On factoring multi-variate polynomials over algebraically closed fields (abstract)
inferredcites →https://doi.org/10.1515/9783112342404-001openalex-snapshot
Grundzüge einer arithmetischen Theorie der algebraischen Grössen
inferredcites →https://doi.org/10.1515/crll.1983.340.26openalex-snapshot
Arithmetic specializations in polynomials.
inferredcites →https://doi.org/10.2307/2007968openalex-snapshot
Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
inferredcites →https://doi.org/10.5802/pmb.a-61openalex-snapshot
Algèbre élémentaire en temps polynomial
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.1997.0439openalex-snapshot
Decoding of Reed Solomon Codes beyond the Error-Correction Bound
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.1006/jsco.1994.1034openalex-snapshot
Multi-Modular Approach to Polynomial-Time Factorization of Bivariate Integral Polynomials
inferred← citeshttps://doi.org/10.1006/jsco.1998.0271openalex-snapshot
Solving Degenerate Sparse Polynomial Systems Faster
inferred← citeshttps://doi.org/10.1006/jsco.1999.1002openalex-snapshot
Factoring Polynomials Over Finite Fields: A Survey
inferred← citeshttps://doi.org/10.1006/jsco.2000.0370openalex-snapshot
Challenges of Symbolic Computation: My Favorite Open Problems
inferred← citeshttps://doi.org/10.1007/10722028_1openalex-snapshot
The Complexity of Some Lattice Problems
inferred← citeshttps://doi.org/10.1007/11590156_2openalex-snapshot
Computational Complexity Since 1980
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_3openalex-snapshot
List Decoding: Algorithms and Applications
inferred← citeshttps://doi.org/10.1007/978-3-0348-8266-8_10openalex-snapshot
Some Introductory Remarks on Computer Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_25openalex-snapshot
The Enumerability of P Collapses P to NC
inferred← citeshttps://doi.org/10.1007/978-3-642-58951-5openalex-snapshot
Computational Methods in Commutative Algebra and Algebraic Geometry
inferred← citeshttps://doi.org/10.1007/978-3-7643-7984-1_5openalex-snapshot
Structured Low Rank Approximation of a Sylvester Matrix
inferred← citeshttps://doi.org/10.1007/978-93-86279-12-5_21openalex-snapshot
Some Topics in Computational Algebraic Geometry
inferred← citeshttps://doi.org/10.1007/b104335openalex-snapshot
List Decoding of Error-Correcting Codes
inferred← citeshttps://doi.org/10.1007/bfb0058031openalex-snapshot
Algorithmic issues in coding theory
inferred← citeshttps://doi.org/10.1007/s00037-009-0283-3openalex-snapshot
Counting Irreducible Components of Complex Algebraic Varieties
inferred← citeshttps://doi.org/10.1007/s00037-015-0102-yopenalex-snapshot
Equivalence of Polynomial Identity Testing and Polynomial Factorization
inferred← citeshttps://doi.org/10.1007/s00037-025-00272-9openalex-snapshot
On Efficient Noncommutative Polynomial Factorization via Higman Linearization
inferred← citeshttps://doi.org/10.1007/s00200-008-0062-4openalex-snapshot
Fast separable factorization and applications
inferred← citeshttps://doi.org/10.1007/s00200-010-0121-5openalex-snapshot
New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
inferred← citeshttps://doi.org/10.1007/s00454-001-0024-0openalex-snapshot
Decomposition of Polytopes and Polynomials
inferred← citeshttps://doi.org/10.1007/s00454-015-9701-2openalex-snapshot
Multilevel Polynomial Partitions and Simplified Range Searching
inferred← citeshttps://doi.org/10.1007/s00454-024-00656-8openalex-snapshot
Intersection Searching amid Tetrahedra in Four Dimensions
inferred← citeshttps://doi.org/10.1007/s10208-016-9318-8openalex-snapshot
Bivariate Factorization Using a Critical Fiber
inferred← citeshttps://doi.org/10.1007/s11425-014-4850-yopenalex-snapshot
Sparse bivariate polynomial factorization
inferred← citeshttps://doi.org/10.1016/j.adhoc.2015.08.027openalex-snapshot
Modified access polynomial based self-healing key management schemes with broadcast authentication and enhanced collusion resistance in wireless sensor networks
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.jsc.2007.01.003openalex-snapshot
Improved dense multivariate polynomial factorization algorithms
inferred← citeshttps://doi.org/10.1016/j.jsc.2007.10.013openalex-snapshot
Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.06.010openalex-snapshot
Modular Las Vegas algorithms for polynomial absolute factorization
inferred← citeshttps://doi.org/10.1016/j.jsc.2020.10.001openalex-snapshot
Efficiently Factoring Polynomials Modulo p4
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.07.010openalex-snapshot
The enumerability of P collapses P to NC
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.11.048openalex-snapshot
A note on Gao’s algorithm for polynomial factorization
inferred← citeshttps://doi.org/10.1016/s0022-4049(97)00030-3openalex-snapshot
A modular method for computing the Galois groups of polynomials
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)80001-1openalex-snapshot
Univariate polynomial factorization over finite fields
inferred← citeshttps://doi.org/10.1017/cbo9781139565769.003openalex-snapshot
The Geometry–Algebra Dictionary
inferred← citeshttps://doi.org/10.1090/s0025-5718-02-01421-7openalex-snapshot
Polynomial factorization over 𝔽₂
inferred← citeshttps://doi.org/10.1109/18.782097openalex-snapshot
Improved decoding of Reed-Solomon and algebraic-geometry codes
inferred← citeshttps://doi.org/10.1109/ccc.1998.694584openalex-snapshot
On membership comparable sets
inferred← citeshttps://doi.org/10.1109/ccc.1999.766274openalex-snapshot
Some recent progress on the complexity of lattice problems
inferred← citeshttps://doi.org/10.1109/ccc.2012.34openalex-snapshot
Matrix Isomorphism of Matrix Lie Algebras
inferred← citeshttps://doi.org/10.1109/ccc.2014.25openalex-snapshot
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization
inferred← citeshttps://doi.org/10.1109/iccad.2005.1560081openalex-snapshot
Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174373openalex-snapshot
Computing the Partition Function of the Sherrington-Kirkpatrick Model is Hard on Average
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548475openalex-snapshot
Maximum likelihood decoding of Reed Solomon codes
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743426openalex-snapshot
Improved decoding of Reed-Solomon and algebraic-geometric codes
inferred← citeshttps://doi.org/10.1109/tc.2005.124openalex-snapshot
An Efficient Basis Conversion Algorithm for Composite Fields with Given Representations
inferred← citeshttps://doi.org/10.1109/tit.2016.2544347openalex-snapshot
Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs
inferred← citeshttps://doi.org/10.1137/1034049openalex-snapshot
Complexity of Computations with Matrices and Polynomials
inferred← citeshttps://doi.org/10.1142/9789814324359_0162openalex-snapshot
Bridging Shannon and Hamming: List Error-correction with Optimal Rate
inferred← citeshttps://doi.org/10.1142/s0218625x12500084openalex-snapshot
THE DIRECT INVERSION OF HELIUM ATOM SCATTERING (HAS) DIFFRACTION SPECTRA
inferred← citeshttps://doi.org/10.1145/1005285.1005300openalex-snapshot
Absolute polynomial factorization in two variables and the knapsack problem
inferred← citeshttps://doi.org/10.1145/1073884.1073914openalex-snapshot
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
inferred← citeshttps://doi.org/10.1145/1145768.1145798openalex-snapshot
Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields
inferred← citeshttps://doi.org/10.1145/1277500.1277502openalex-snapshot
Approximate bivariate factorization
inferred← citeshttps://doi.org/10.1145/130933.130939openalex-snapshot
A polynomial factorization challenge
inferred← citeshttps://doi.org/10.1145/1577190.1577199openalex-snapshot
Exact polynomial factorization by approximate high degree algebraic numbers
inferred← citeshttps://doi.org/10.1145/1577190.1577201openalex-snapshot
Extracting numerical factors of multivariate polynomials from taylor expansions
inferred← citeshttps://doi.org/10.1145/236869.236882openalex-snapshot
Arithmetic and factorization of polynomial over F2 (extended abstract)
inferred← citeshttps://doi.org/10.1145/281508.281624openalex-snapshot
Efficient algorithms for computing the nearest polynomial with constrained roots
inferred← citeshttps://doi.org/10.1145/309831.309937openalex-snapshot
Efficient algorithms for computing the nearest polynomial with a real root and related problems
inferred← citeshttps://doi.org/10.1145/345542.345616openalex-snapshot
Pseudofactors of multivariate polynomials
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/3532737.3532745openalex-snapshot
SIGACT News Complexity Theory Column 112
inferred← citeshttps://doi.org/10.1145/3815436.3815468openalex-snapshot
An Algorithm for Diagonalizing Matrices of Formal Power Series
inferred← citeshttps://doi.org/10.1145/384101.384114openalex-snapshot
Towards factoring bivariate approximate polynomials
inferred← citeshttps://doi.org/10.1145/780506.780512openalex-snapshot
A geometric-numeric algorithm for absolute factorization of multivariate polynomials
inferred← citeshttps://doi.org/10.1145/780506.780532openalex-snapshot
Yet another practical implementation of polynomial factorization over finite fields
inferred← citeshttps://doi.org/10.1145/860854.860893openalex-snapshot
On approximate irreducibility of polynomials in several variables
inferred← citeshttps://doi.org/10.1184/r1/6605417openalex-snapshot
Explicit rank-metric codes list-decodable with optimal redundancy
inferred← citeshttps://doi.org/10.1214/20-aap1625openalex-snapshot
Computing the partition function of the Sherrington-Kirkpatrick model is hard on average
inferred← citeshttps://doi.org/10.3390/math10142389openalex-snapshot
Generating Integrally Indecomposable Newton Polygons with Arbitrary Many Vertices
inferred← citeshttps://doi.org/10.3929/ethz-a-003828824openalex-snapshot
Factorization of multivariate polynomials over finite fields
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2014.748openalex-snapshot
Evading Subspaces Over Large Fields and Explicit List-decodable Rank-metric Codes
inferred← citeshttps://doi.org/10.46298/dmtcs.9877openalex-snapshot
A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum
inferred← citeshttps://doi.org/10.48550/arxiv.0911.5024openalex-snapshot
Modular Las Vegas Algorithms for Polynomial Absolute Factorization
inferred← citeshttps://doi.org/10.48550/arxiv.1406.3058openalex-snapshot
Multilevel polynomial partitions and simplified range searching
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0304040openalex-snapshot
Hardness as randomness: a survey of universal derandomization
inferred← citeshttps://doi.org/10.5555/1129601.1129644openalex-snapshot
Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra
inferred← citeshttps://doi.org/10.5555/314613.314646openalex-snapshot
Reconstructing randomly sampled multivariate polynomials from highly noisy data
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.