scientific article; zbMATH DE number 3785035
zbMATH Open0498.13006MaRDI QIDQ3963124FDOQ3963124
Authors: D. Y. Y. Yun 
Publication date: 1976
Title of this publication is not available (Why is that?)
algorithmsunique factorization domainmodular arithmeticHensel constructionSQFRsquare-free decomposition of polynomials
Symbolic computation and algebraic computation (68W30) Polynomials over commutative rings (13B25) Polynomials in real and complex fields: factorization (12D05) Commutative rings defined by factorization properties (e.g., atomic, factorial, half-factorial) (13F15) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to commutative algebra (13-04)
Cited In (27)
- Subquadratic algorithms for algebraic 3SUM
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields
- A verified implementation of the Berlekamp-Zassenhaus factorization algorithm
- Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
- Roots multiplicity and square-free factorization of polynomials using companion matrices
- Approximate square-free part and decomposition
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
- Computing Frobenius maps and factoring polynomials
- Explicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\)
- Deterministic distinct-degree factorization of polynomials over finite fields
- Symbolic iterative algorithm for generalized inversion of rational polynomial matrices
- Effective computation of base points of ideals in two-dimensional local rings
- Title not available (Why is that?)
- Univariate polynomial factorization over finite fields
- Degenerate parametric curves
- Improved algorithms for computing determinants and resultants
- A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
- The Power of Leibniz-Like Functions as Oracles
- On square-free factorization of multivariate polynomials over a finite field.
- Real stability testing
- Fast square-free decomposition of integers using class groups
- New techniques for the computation of linear recurrence coefficients
- Polynomial factorization over ${\mathbb F}_2$
- Detecting lacunary perfect powers and computing their roots
- A conflict-driven solving procedure for poly-power constraints
- Square-free algorithms in positive characteristic
- Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
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)
