Factoring a binary polynomial of degree over one million
From MaRDI portal
Cantor's multiplication algorithmcomputer algebraparallel communicationpolynomial factorizationpseudorandom polynomial
Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Symbolic computation and algebraic computation (68W30)
Recommendations
- Factoring polynomials using binary representations of finite fields
- Factoring multivariate polynomials with many factors and huge coefficients
- Factoring Multivariate Polynomials over Large Finite Fields
- scientific article; zbMATH DE number 3880116
- On polynomial factorization
- Factoring polynomials over arbitrary finite fields
- The numerical factorization of polynomials
- Factoring polynomials using fewer random bits
- scientific article; zbMATH DE number 6008333
- Factoring polynomials over finite fields
Cited in
(8)- Factorization of Boolean polynomials: parallel algorithms and experimental evaluation
- Interval partitions and polynomial factorization
- A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over F₂
- Polynomial factorization over ${\mathbb F}_2$
- scientific article; zbMATH DE number 3939455 (Why is no real title available?)
- scientific article; zbMATH DE number 1254269 (Why is no real title available?)
- Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2
- Computing special powers in finite fields
This page was built for publication: Factoring a binary polynomial of degree over one million
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4810180)
