Factorization of Multivariate Polynomials Over Finite Fields
From MaRDI portal
Recommendations
Cited in
(36)- Factoring sparse polynomials fast
- Hardness of Reconstructing Multivariate Polynomials over Finite Fields
- Factoring Multivariate Polynomials over Large Finite Fields
- Counting curves and their projections
- An empirical study of cache-oblivious polygon indecomposability testing
- Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic
- scientific article; zbMATH DE number 3893305 (Why is no real title available?)
- Deterministic distinct-degree factorization of polynomials over finite fields
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- Factoring multivariate polynomials via partial differential equations
- Factorization of polynomials over finite fields and characteristic sequences
- Encounters in symbolic computation: ideas for the ages
- Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem
- scientific article; zbMATH DE number 4145747 (Why is no real title available?)
- Complexity of solving parametric polynomial systems
- Parallel methods for absolute irreducibility testing
- Factoring sparse multivariate polynomials
- Factoring polynomials and primitive elements for special primes
- Irreducible compositions of polynomials over finite fields of even characteristic
- Polylog depth circuits for integer factoring and discrete logarithms
- Values of polynomials over finite fields
- Multiplication of Polynomials over Finite Fields
- Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.
- Factorization of composite polynomials over finite fields
- Factorization of polynomials over valued fields based on graded polynomials
- On square-free factorization of multivariate polynomials over a finite field.
- Subquadratic-time factoring of polynomials over finite fields
- Factoring polynomials over function fields
- Deterministic irreducibility testing of polynomials over large finite fields
- Improved dense multivariate polynomial factorization algorithms
- Theory of computational complexity. Part 9. Transl. from the Russian.
- scientific article; zbMATH DE number 2077079 (Why is no real title available?)
- On Bivariate Polynomial Factorization over Finite Fields
- Irreducibility of multivariate polynomials
- Computation of simple and group factors of multivariate polynomials
- The computational complexity of recognizing permutation functions
This page was built for publication: Factorization of Multivariate Polynomials Over Finite Fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3728101)
