Computationally classifying polynomials with small Euclidean norm having reducible non-reciprocal parts
From MaRDI portal
Publication:5226549
DOI10.4064/BC118-15zbMATH Open1419.11141OpenAlexW2963225557WikidataQ127454271 ScholiaQ127454271MaRDI QIDQ5226549FDOQ5226549
A. F. Vincent, Robert F. Murphy, Michael Filaseta
Publication date: 31 July 2019
Published in: Banach Center Publications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/bc118-15
Recommendations
- Computational aspects of irreducible polynomials
- Characterizing polynomial complexity classes by reducibilities
- scientific article; zbMATH DE number 1305288
- Computational experiences on the distances of polynomials to irreducible polynomials
- Irreducibility criteria for reciprocal polynomials and applications
- An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
- On the complexity of the computation of certain classes of polynomials of several variables
- On the Irreducibility of Certain Classes of Polynomials
- Computing the equisingularity type of a pseudo-irreducible polynomial
- scientific article; zbMATH DE number 4070302
Cites Work
- Title not available (Why is that?)
- On the irreducibility of certain trinomials
- Title not available (Why is that?)
- On the Irreducibility of Certain Trinomials and Quadrinomials.
- Solution d'un problème de K. Zarankiewicz sur les suites de puissances consécutives de nombres irrationnels
- On the Irreducibility of the Trinomials $x^n\pm x^m\pm1$.
- Title not available (Why is that?)
- An extension of a theorem by Ljunggren
- The factorization of certain quadrinominals.
- Reducibility of lacunary polynomials XII
Cited In (1)
This page was built for publication: Computationally classifying polynomials with small Euclidean norm having reducible non-reciprocal parts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5226549)
