Irreducibility of multivariate polynomials

DOI10.1016/0022-0000(85)90043-1zbMATH Open0604.68043OpenAlexW2042803397MaRDI QIDQ1083191FDOQ1083191

Authors: Joachim von zur Gathen 

Publication date: 1985

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(85)90043-1

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

zbMATH Keywords

finite fieldsmultivariate polynomialmultiplicitiesdegreesalgebraic number fieldsirreducible factorseffective version of Hilbert's irreducibility theorempolynomial-time probabilistic algorithmsprobabilistic reduction from multivariate to bivariate polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials in general fields (irreducibility, etc.) (12E05)

Cites Work

• Title not available (Why is that?)
• Factoring polynomials with rational coefficients
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Fast Monte-Carlo Test for Primality
• Factoring Polynomials Over Large Finite Fields
• Berechnung und Programm. I
• Approximate formulas for some functions of prime numbers
• The Computational Complexity of Continued Fractions
• Fast Parallel Computation of Polynomials Using Few Processors
• Polynomials with Rational Coefficients Which are Hard to Compute
• Factoring sparse multivariate polynomials
• Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
• Probabilistic Algorithms in Finite Fields
• Title not available (Why is that?)
• Definability and fast quantifier elimination in algebraically closed fields
• Title not available (Why is that?)
• Factoring numbers in O(log n) arithmetic steps
• Fast parallel matrix and GCD computations
• Title not available (Why is that?)
• Parallel Algorithms for Algebraic Problems
• Factoring Polynomials over Algebraic Number Fields
• Factoring multivariate polynomials over finite fields
• Title not available (Why is that?)
• New NP-hard and NP-complete polynomial and integer divisibility problems
• Systems of distinct representatives and linear algebra
• Factoring multivariate integral polynomials
• On Hensel factorization. I
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences
• Fast parallel absolute irreducibility testing
• Factorization of Multivariate Polynomials Over Finite Fields
• Title not available (Why is that?)
• Finding the number of factors of a polynomial
• Diophantine equations with unknown prime numbers
• A Generalized Class of Polynomials that are Hard to Factor
• Title not available (Why is that?)
• Restructuring of Arithmetic Expressions For Parallel Evaluation

Cited In (51)

• Pseudoirreducible polynomials: probabilistic irreducibility testing
• Irreducibility testing over local fields
• Constructing normal bases in finite 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
• Decompositions of nonlinear input-output systems to zero the output
• A Quick and Dirty Irreducibility Test for Multivariate Polynomials over 𝔽_q
• Factoring Rational Polynomials over the Complex Numbers
• Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
• Feasible arithmetic computations: Valiant's hypothesis
• 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.
• Irreducibility of Binomials
• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
• Interpolating polynomials from their values
• Title not available (Why is that?)
• New Sparse Multivariate Polynomial Factorization Algorithms over Integers
• Decomposition of algebras over finite fields and number fields
• New absolute irreducibility testing criteria and factorization of multivariate polynomials
• Title not available (Why is that?)
• Title not available (Why is that?)
• Parallel methods for absolute irreducibility testing
• Effective Hilbert irreducibility
• Fast parallel absolute irreducibility testing
• Factoring sparse multivariate polynomials
• Irreducibility of Polynomials
• Probabilistic absolute irreducibility test for polynomials
• Boolean circuits versus arithmetic circuits
• Title not available (Why is that?)
• The complexity of factors of multivariate polynomials
• Irreducible multivariate polynomials obtained from polynomials in fewer variables. II
• 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
• On the complexity of multivariate polynomial division
• 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)