A non-NP-complete algorithm for a quasi-fixed polynomial problem (Q370288): Difference between revisions

Summary: Let \(F : \mathbb R \times \mathbb R \to \mathbb R\) be a real-valued polynomial function of the form \(F(x, y) = \sum^s_{i = 0}f_i(x)y^i\), with degree of \(y\) in \(F(x, y) = s \geq 1\), \(x \in \mathbb R\). An irreducible real-valued polynomial function \(p(x)\) and a nonnegative integer \(m\) are given to find a polynomial function \(y(x) \in \mathbb R[x]\) satisfying the following expression: \(F(x, y(x)) = cp^m(x)\) for some constant \(c \in \mathbb R\). The constant \(c\) is dependent on the solution \(y(x)\), namely, a quasi-fixed (polynomial) solution of the polynomial-like equation \((\ast)\). In this paper, we provide a non-NP-complete algorithm to solve all quasi-fixed solutions if the equation \((\ast)\) has only a finite number of quasi-fixed solutions.