scientific article
From MaRDI portal
Publication:3963124
zbMath0498.13006MaRDI QIDQ3963124
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmsunique factorization domainmodular arithmeticHensel constructionSQFRsquare-free decomposition of polynomials
Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomials in real and complex fields: factorization (12D05) Polynomials over commutative rings (13B25) Commutative rings defined by factorization properties (e.g., atomic, factorial, half-factorial) (13F15) Algorithms in computer science (68W99)
Related Items
Computing Frobenius maps and factoring polynomials, The Power of Leibniz-Like Functions as Oracles, Explicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\), Deterministic distinct-degree factorization of polynomials over finite fields, Square-free algorithms in positive characteristic, Univariate polynomial factorization over finite fields, On square-free factorization of multivariate polynomials over a finite field., Subquadratic algorithms for algebraic 3SUM, Roots multiplicity and square-free factorization of polynomials using companion matrices, A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics, Complexity bounds for the rational Newton-Puiseux algorithm over finite fields, Detecting lacunary perfect powers and computing their roots, New techniques for the computation of linear recurrence coefficients, Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials, Approximate square-free part and decomposition, A verified implementation of the Berlekamp-Zassenhaus factorization algorithm, Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields, Effective computation of base points of ideals in two-dimensional local rings, Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes, Improved algorithms for computing determinants and resultants, Unnamed Item, Symbolic iterative algorithm for generalized inversion of rational polynomial matrices, A conflict-driven solving procedure for poly-power constraints, Unnamed Item, Degenerate parametric curves, Polynomial factorization over ${\mathbb F}_2$
