Polynomial and special function theory remains a vibrant area of mathematical research, interweaving classical algebra with advanced analysis. At its core, the study concerns algebraic expressions ...

This paper starts by settling the computational complexity of the problem of integrating a polynomial function f over a rational simplex. We prove that the problem is NP-hard for arbitrary polynomials ...

The amount of time it takes for an algorithm to solve a polynomial function, which is a mathematical expression that does not contain fractions or negative numbers. The time is proportional to the ...

This function is a polynomial in two dimensions, with terms up to degree 5. It is nonlinear, and it is smooth despite being complex, which is common for computer ...

We solve polynomials algebraically in order to determine the roots - where a curve cuts the \(x\)-axis. A root of a polynomial function, \(f(x)\), is a value for \(x\) for which \(f(x) = 0\).

The conditional variance function in a heteroscedastic, nonparametric regression model is estimated by linear smoothing of squared residuals. Attention is focused on local polynomial smoothers. Both ...