Factoring a binary polynomial of degree over one million
DOI10.1145/504331.504333zbMATH Open1054.65047OpenAlexW2140863472MaRDI QIDQ4810180FDOQ4810180
Authors: Olaf Bonorden, Joachim von zur Gathen, Jürgen Gerhard, Olaf Müller, Michael Nöcker 
Publication date: 1 September 2004
Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/504331.504333
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
computer algebrapolynomial factorizationparallel communicationCantor's multiplication algorithmpseudorandom polynomial
Symbolic computation and algebraic computation (68W30) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05)
Cited In (6)
- Interval partitions and polynomial factorization
- Factorization of Boolean polynomials: parallel algorithms and experimental evaluation
- A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\)
- Title not available (Why is that?)
- Polynomial factorization over ${\mathbb F}_2$
- 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)
