scientific article; zbMATH DE number 1273636
From MaRDI portal
Publication:4237366
Recommendations
- A new efficient factorization algorithm for polynomials over small finite fields
- scientific article; zbMATH DE number 691482
- A New Algorithm for Factoring Polynomials Over Finite Fields
- scientific article; zbMATH DE number 1594303
- scientific article; zbMATH DE number 1253982
- A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
- On the deterministic complexity of factoring polynomials over finite fields
- An efficient algorithm for factoring polynomials over algebraic extension field
- Deterministic distinct-degree factorization of polynomials over finite fields
- On a New Factorization Algorithm for Polynomials Over Finite Fields
Cited in
(27)- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields
- scientific article; zbMATH DE number 691482 (Why is no real title available?)
- Modular composition modulo triangular sets and applications
- Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
- Deterministic root finding in finite fields
- Computing Frobenius maps and factoring polynomials
- A new efficient factorization algorithm for polynomials over small finite fields
- Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic
- Deterministic distinct-degree factorization of polynomials over finite fields
- On the deterministic complexity of factoring polynomials over finite fields
- Deterministic root finding over finite fields using Graeffe transforms
- Factoring of \(x^ n -1\) and orthogonalization over finite fields of characteristic 2
- A Deterministic Algorithm for Factorizing Polynomials over Extensions GF(pm) of GF(p), p a Small Prime
- Univariate polynomial factorization over finite fields
- A subquadratic algorithm for computing the n-th Bernoulli number
- Bivariate polynomial reduction and elimination ideal over finite fields
- On some computations on sparse polynomials
- On the Selection of Polynomials for the DLP Quasi-Polynomial Time Algorithm for Finite Fields of Small Characteristic
- Factoring polynomials over arbitrary finite fields
- A babystep-giantstep method for faster deterministic integer factorization
- Subquadratic-time factoring of polynomials over finite fields
- Elimination ideal and bivariate resultant over finite fields
- scientific article; zbMATH DE number 5733040 (Why is no real title available?)
- Factoring polynomials over finite fields
- On Bivariate Polynomial Factorization over Finite Fields
- A new faster algorithm for factoring skew polynomials over finite fields
- Threshold data structures and coding theory
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 Q4237366)
