Irreducibility testing of lacunary 0,1-polynomials

DOI10.1016/J.JALGOR.2004.10.005MaRDI QIDQ4675486zbMATH OpenOpenAlexFDO

Authors Michael Filaseta, Douglas B. Meade

Publication date 4 May 2005

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgor.2004.10.005

zbMATH Keywords

IrreducibilitySparse0,1-polynomialLacunaryNon-reciprocal part

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Practical aspects of testing the irreducibility of the non-reciprocal part of a 0,1-polynomial
• On the irreducibility of 0,1-polynomials of the form f(x) xⁿ+ g(x)
• Irreducibility and greatest common divisor algorithms for sparse polynomials
• An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity
• On testing the divisibility of lacunary polynomials by cyclotomic polynomials

Cited in

(10)

• An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity
• Factorization of composition of reciprocal polynomials with monomials
• Practical aspects of testing the irreducibility of the non-reciprocal part of a 0,1-polynomial
• Phase retrieval for sparse binary signal: uniqueness and algorithm
• On the irreducibility of 0,1-polynomials of the form f(x) xⁿ+ g(x)
• A heuristic irreducibility test for univariate polynomials
• One-dimensional phase retrieval: regularization, box relaxation and uniqueness
• On testing the divisibility of lacunary polynomials by cyclotomic polynomials
• Irreducibility criteria for reciprocal polynomials and applications
• Irredundant test sets for Zhegalkin polynomials affine equivalent to the ball and insufficiency of this description in the general case

This page was built for publication: Irreducibility testing of lacunary 0,1-polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4675486)