Irreducibility testing of lacunary 0,1-polynomials

DOI10.1016/j.jalgor.2004.10.005zbMath1094.68124OpenAlexW2082494928MaRDI QIDQ4675486

Douglas B. Meade, Michael Filaseta

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)

Related Items (5)

Irreducibility Criteria for Reciprocal Polynomials and Applications ⋮ Factorization of composition of reciprocal polynomials with monomials ⋮ One-dimensional phase retrieval: regularization, box relaxation and uniqueness ⋮ Unnamed Item ⋮ Phase retrieval for sparse binary signal: uniqueness and algorithm

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