Polynomial factorization over {\mathbb F}_2
From MaRDI portal
Publication:3147181
Recommendations
Cites work
- scientific article; zbMATH DE number 3785035 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1246619 (Why is no real title available?)
- scientific article; zbMATH DE number 1254267 (Why is no real title available?)
- scientific article; zbMATH DE number 1263398 (Why is no real title available?)
- scientific article; zbMATH DE number 691468 (Why is no real title available?)
- scientific article; zbMATH DE number 691482 (Why is no real title available?)
- scientific article; zbMATH DE number 953213 (Why is no real title available?)
- scientific article; zbMATH DE number 922674 (Why is no real title available?)
- scientific article; zbMATH DE number 3265895 (Why is no real title available?)
- A New Algorithm for Factoring Polynomials Over Finite Fields
- A new polynomial factorization algorithm and its implementation
- Algebraic coding theory
- Computing Frobenius maps and factoring polynomials
- Counting irreducible factors of polynomials over a finite field
- Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2
- Factoring Polynomials Over Large Finite Fields
- Factoring a binary polynomial of degree over one million
- Factoring polynomials over finite fields: A survey
- Fast multiplication of large numbers
- Fast multiplication of polynomials over fields of characteristic 2
- Modern computer algebra
- On arithmetical algorithms over finite fields
- On fast multiplication of polynomials over arbitrary algebras
- Subquadratic-time factoring of polynomials over finite fields
- The Computational Complexity of Continued Fractions
Cited in
(14)- Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count
- scientific article; zbMATH DE number 2151191 (Why is no real title available?)
- Fast arithmetics in Artin-Schreier towers over finite fields
- scientific article; zbMATH DE number 6500356 (Why is no real title available?)
- Faster Multiplication in GF(2)[x]
- scientific article; zbMATH DE number 3968703 (Why is no real title available?)
- Interval partitions and polynomial factorization
- Parallel Processing and Applied Mathematics
- scientific article; zbMATH DE number 3856292 (Why is no real title available?)
- scientific article; zbMATH DE number 3939455 (Why is no real title available?)
- A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\)
- scientific article; zbMATH DE number 6981627 (Why is no real title available?)
- An application of factoring
- Computing special powers in finite fields
This page was built for publication: Polynomial factorization over ${\mathbb F}_2$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147181)
