Irreducibility of multivariate polynomials
From MaRDI portal
Publication:1083191
Recommendations
- Irreducibility of Polynomials
- Irreducibility criteria for compositions of multivariate polynomials
- An irreducibility criterion for polynomials in several variables
- Irreducible multivariate polynomials obtained from polynomials in fewer variables
- Irreducibility of integer-valued polynomials in several variables
- scientific article; zbMATH DE number 2124951
- Irreducibility results for compositions of polynomials in several variables
- Some Pólya-type irreducibility criteria for multivariate polynomials
- On the irreducibility of bivariate polynomials
- Irreducibility criteria for compositions of multivariate polynomials over arbitrary fields
Cites work
- scientific article; zbMATH DE number 3838204 (Why is no real title available?)
- scientific article; zbMATH DE number 3858405 (Why is no real title available?)
- scientific article; zbMATH DE number 3935166 (Why is no real title available?)
- scientific article; zbMATH DE number 3181273 (Why is no real title available?)
- scientific article; zbMATH DE number 3723860 (Why is no real title available?)
- scientific article; zbMATH DE number 3757697 (Why is no real title available?)
- scientific article; zbMATH DE number 3461412 (Why is no real title available?)
- scientific article; zbMATH DE number 3634395 (Why is no real title available?)
- scientific article; zbMATH DE number 3804835 (Why is no real title available?)
- scientific article; zbMATH DE number 3445379 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- scientific article; zbMATH DE number 3265895 (Why is no real title available?)
- scientific article; zbMATH DE number 3390942 (Why is no real title available?)
- A Fast Monte-Carlo Test for Primality
- A Generalized Class of Polynomials that are Hard to Factor
- Approximate formulas for some functions of prime numbers
- Berechnung und Programm. I
- Definability and fast quantifier elimination in algebraically closed fields
- Diophantine equations with unknown prime numbers
- Factoring Polynomials Over Large Finite Fields
- Factoring Polynomials over Algebraic Number Fields
- Factoring multivariate integral polynomials
- Factoring multivariate polynomials over finite fields
- Factoring numbers in O(log n) arithmetic steps
- Factoring polynomials with rational coefficients
- Factoring sparse multivariate polynomials
- Factorization of Multivariate Polynomials Over Finite Fields
- Fast Parallel Computation of Polynomials Using Few Processors
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fast parallel absolute irreducibility testing
- Fast parallel matrix and GCD computations
- Finding the number of factors of a polynomial
- New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences
- New NP-hard and NP-complete polynomial and integer divisibility problems
- On Hensel factorization. I
- Parallel Algorithms for Algebraic Problems
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- Polynomials with Rational Coefficients Which are Hard to Compute
- Probabilistic Algorithms in Finite Fields
- Restructuring of Arithmetic Expressions For Parallel Evaluation
- Systems of distinct representatives and linear algebra
- The Computational Complexity of Continued Fractions
Cited in
(51)- On the complexity of multivariate polynomial division
- Pseudoirreducible polynomials: probabilistic irreducibility testing
- Constructing normal bases in finite fields
- Irreducibility testing over local fields
- Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems
- Certifying irreducibility in \(\mathbb{Z}[x]\)
- Extended Hilbert Irreducibility and Its Applications
- A Quick and Dirty Irreducibility Test for Multivariate Polynomials over 𝔽q
- Factoring Rational Polynomials over the Complex Numbers
- Feasible arithmetic computations: Valiant's hypothesis
- Decompositions of nonlinear input-output systems to zero the output
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- Absolute irreducibility of polynomials via Newton polytopes
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
- Irreducibility of a polynomial over the field of \(p\) elements with \(p\) prime.
- Irreducibility of integer-valued polynomials in several variables
- Computing Frobenius maps and factoring polynomials
- Irreducibility of some orthogonal polynomials
- Counting reducible and singular bivariate polynomials
- On the irreducibility of multivariate subresultants.
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Interpolating polynomials from their values
- Irreducibility of Binomials
- scientific article; zbMATH DE number 3959582 (Why is no real title available?)
- Decomposition of algebras over finite fields and number fields
- New Sparse Multivariate Polynomial Factorization Algorithms over Integers
- New absolute irreducibility testing criteria and factorization of multivariate polynomials
- scientific article; zbMATH DE number 5809457 (Why is no real title available?)
- Parallel methods for absolute irreducibility testing
- scientific article; zbMATH DE number 1418483 (Why is no real title available?)
- Fast parallel absolute irreducibility testing
- Factoring sparse multivariate polynomials
- Effective Hilbert irreducibility
- Irreducibility of Polynomials
- Probabilistic absolute irreducibility test for polynomials
- Boolean circuits versus arithmetic circuits
- Irreducible multivariate polynomials obtained from polynomials in fewer variables. II
- The complexity of factors of multivariate polynomials
- scientific article; zbMATH DE number 1189231 (Why is no real title available?)
- Bivariate factorization using a critical fiber
- Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
- Computational complexity of sentences over fields
- Bounds for the multiplicities of the irreducible factors of a multivariate polynomial
- Improved dense multivariate polynomial factorization algorithms
- Effective Noether irreducibility forms and applications
- Sentences over integral domains and their computational complexities
- Incidences between points and curves with almost two degrees of freedom
- A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\)
- Functional decomposition of polynomials: the tame case
- Computational aspects of irreducible polynomials
- Distances from differences of roots of polynomials to the nearest integers
This page was built for publication: Irreducibility of multivariate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1083191)
