Factorization of Polynomials over the Field of Rational Numbers
Duggirala Meher Krishna, Duggirala Ravi
Abstract
Open-access reader
Duggirala Meher Krishna, Duggirala Ravi
Abstract
Open-access reader
In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on conversion of a given polynomial into a polynomial with integer coefficients and reduction to mod p, for several large prime numbers p, without applying a lifting method.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on conversion of a given polynomial into a polynomial with integer coefficients and reduction to mod p, for several large prime numbers p, without applying a lifting method.
Key concepts: Mathematics, Factorization of polynomials, Irreducible polynomial, Factorization, Square-free polynomial, Irreducibility, Polynomial, Reciprocal polynomial