Abstract
In this paper, we generalize the conclusion provided by 仙童数学. We derive a class of higher-degree polynomials that can be reduced to linear polynomials. We also prove that there is no polynomial with a degree greater than the number of variables. This conclusion holds significant potential for reducing the computational complexity of solving higher-degree equations on computers.