scientific article; zbMATH DE number 3785035
From MaRDI portal
Publication:3963124
algorithmsHensel constructionmodular arithmeticSQFRsquare-free decomposition of polynomialsunique factorization domain
Polynomials in real and complex fields: factorization (12D05) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomials over commutative rings (13B25) Commutative rings defined by factorization properties (e.g., atomic, factorial, half-factorial) (13F15) Symbolic computation and algebraic computation (68W30) Algorithms in computer science (68W99)
Cited in
(30)- Degenerate parametric curves
- Univariate polynomial factorization over finite fields
- On square-free factorization of multivariate polynomials over a finite field.
- Explicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\)
- Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
- Effective computation of base points of ideals in two-dimensional local rings
- Improved algorithms for computing determinants and resultants
- Square-free algorithms in positive characteristic
- New techniques for the computation of linear recurrence coefficients
- A verified implementation of the Berlekamp-Zassenhaus factorization algorithm
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields
- Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
- Approximate square-free part and decomposition
- A conflict-driven solving procedure for poly-power constraints
- Computing Frobenius maps and factoring polynomials
- Subquadratic algorithms for algebraic 3SUM
- Deterministic distinct-degree factorization of polynomials over finite fields
- Polynomial factorization over ${\mathbb F}_2$
- Berlekamp Zassenhaus
- Roots multiplicity and square-free factorization of polynomials using companion matrices
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
- Real stability testing
- The Power of Leibniz-Like Functions as Oracles
- scientific article; zbMATH DE number 7559413 (Why is no real title available?)
- Symbolic iterative algorithm for generalized inversion of rational polynomial matrices
- A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
- Detecting lacunary perfect powers and computing their roots
- Fast square-free decomposition of integers using class groups
- Factoring sparse polynomials fast
- Polynomial XL: a variant of the XL algorithm using Macaulay matrices over polynomial rings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3963124)
