scientific article; zbMATH DE number 800174
From MaRDI portal
Publication:4848920
Recommendations
- Factoring bivariate polynomials with integer coefficients via Newton polygons
- Multi-modular approach to polynomial-time factorization of bivariate integral polynomials
- Towards factoring bivariate approximate polynomials
- Factorizations of polynomials with integral non-negative coefficients
- On Bivariate Polynomial Factorization over Finite Fields
- A general factorization method for multivariable polynomials
- Bivariate factorizations via Galois theory, with application to exceptional polynomials
- A new polynomial factorization algorithm and its implementation
- Complexity issues in bivariate polynomial factorization
Cited in
(11)- Relative factorization of polynomials of several variables
- A note on separated factors of separated polynomials
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
- Towards factoring bivariate approximate polynomials
- Elementary theory of factoring trinomials with integer coefficients over the integers
- Extension of expansion base algorithm for multivariate analytic factorization including the case of singular leading coefficient
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- scientific article; zbMATH DE number 1309684 (Why is no real title available?)
- A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\)
- An application of bivariate polynomial factorization on decoding of Reed-Solomon based codes
- Factoring bivariate polynomials with integer coefficients via Newton polygons
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 Q4848920)
