Let be a real-valued polynomial function of the form , with degree of in An irreducible real-valued polynomial function and a nonnegative integer are given to find a polynomial function satisfying the following expression: for some constant . The constant is dependent on the solution , namely, a quasi-fixed (polynomial) solution of the polynomial-like equation . In this paper, we will provide a non-NP-complete algorithm to solve all quasi-fixed solutions if the equation has only a finite number of quasi-fixed solutions.
"A Non-NP-Complete Algorithm for a Quasi-Fixed Polynomial Problem." Abstr. Appl. Anal. 2013 (SI60) 1 - 10, 2013. https://doi.org/10.1155/2013/893045