Irreducibility testing of lacunary 0,1-polynomials
From MaRDI portal
Publication:4675486
DOI10.1016/J.JALGOR.2004.10.005zbMATH Open1094.68124OpenAlexW2082494928MaRDI QIDQ4675486FDOQ4675486
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
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) xn+ 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
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)
Cited In (10)
- An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity
- On the irreducibility of 0,1-polynomials of the form f(x) xn+ g(x)
- On testing the divisibility of lacunary polynomials by cyclotomic polynomials
- Title not available (Why is that?)
- One-dimensional phase retrieval: regularization, box relaxation and uniqueness
- Irreducibility Criteria for Reciprocal Polynomials and Applications
- Phase retrieval for sparse binary signal: uniqueness and algorithm
- Factorization of composition of reciprocal polynomials with monomials
- A heuristic irreducibility test for univariate polynomials
- 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)
