Hard to Detect Factors of Univariate Integer Polynomials

Hard to Detect Factors of Univariate Integer Polynomials

We investigate the computational complexity of deciding whether a given univariate integer polynomial <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>p</mi><mo>(</mo><mi>x...

Full description

Bibliographic Details
Main Authors: Alberto Dennunzio, Enrico Formenti, Luciano Margara
Format: Article
Language:English
Published: MDPI AG 2023-08-01
Series:Mathematics
Subjects:
computational complexity
polynomials
factorization
NP-completeness
semirings
Online Access:https://www.mdpi.com/2227-7390/11/16/3602

Internet

https://www.mdpi.com/2227-7390/11/16/3602

Similar Items