The following pages link to (Q3963124):
Displayed 26 items.
- Roots multiplicity and square-free factorization of polynomials using companion matrices (Q417438) (← links)
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752) (← links)
- Symbolic iterative algorithm for generalized inversion of rational polynomial matrices (Q580902) (← links)
- A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics (Q629354) (← links)
- Detecting lacunary perfect powers and computing their roots (Q650838) (← links)
- Degenerate parametric curves (Q1064767) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- On square-free factorization of multivariate polynomials over a finite field. (Q1389623) (← links)
- Explicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\) (Q1633281) (← links)
- Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials (Q1733314) (← links)
- Effective computation of base points of ideals in two-dimensional local rings (Q1757006) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- Square-free algorithms in positive characteristic (Q1908897) (← links)
- New techniques for the computation of linear recurrence coefficients (Q1971066) (← links)
- A verified implementation of the Berlekamp-Zassenhaus factorization algorithm (Q1984794) (← links)
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields (Q1994892) (← links)
- Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes (Q2000290) (← links)
- Approximate square-free part and decomposition (Q2229724) (← links)
- A conflict-driven solving procedure for poly-power constraints (Q2303230) (← links)
- Computing Frobenius maps and factoring polynomials (Q2366168) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- Deterministic distinct-degree factorization of polynomials over finite fields (Q2643572) (← links)
- Polynomial factorization over ${\mathbb F}_2$ (Q3147181) (← links)
- (Q4638054) (← links)
- The Power of Leibniz-Like Functions as Oracles (Q5042247) (← links)
- (Q5089209) (← links)