Chebyshev polynomials, a central class of orthogonal polynomials, have long been pivotal in numerical analysis, approximation theory and the solution of differential equations. Their inherent ...

Arithmetic circuit complexity investigates the computational resources required to evaluate polynomial functions via networks of arithmetic operations. At its core, this field seeks to classify ...

SIAM Review contains articles that are written for a wide scientific audience. Articles include expository or survey papers focusing on important advances in applied or computational mathematics, or ...

Long considered solved, David Hilbert’s question about seventh-degree polynomials is leading researchers to a new web of mathematical connections. Success is rare in math. Just ask Benson Farb. “The ...