Abstract
By sphenic polynomials, we mean polynomials formed by the product of three (not necessarily different) irreducible polynomials with a priori unknown degree. The study's main goal is to develop an effective algorithm for factorizing degrees of sphenic polynomials with minimal computational complexity. Different solutions to the problem of factorization degrees of sphenic polynomials depending on the ratio degree of the cycle period of these polynomials consider. The sphenic polynomial cycle period defines as a parameter equal to the number of non-repeating subtractions computed on the linear-logarithmic scale of the group formed by the sphenic polynomial. The proposed algorithm is invariant to the characteristics of the Galois fields generated by the multipliers of sphenic polynomials. Numerous numerical examples confirm the correctness of the results. Directions for further research outlines.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.