Three hours of lecture/discussion per week. Algebraic operations on polynomials and rational functions as expressions, in equations, or inequalities. Graphing of linear and polynomial equations. An ...

Algorithmic complexity, a cornerstone of theoretical computer science, examines the intrinsic resource requirements of computational problems and the limits of what can be efficiently computed. Within ...

We prove the existence of nonconstant harmonic functions with polynomial growth on manifolds with nonnegative Ricci curvature, Euclidean volume growth and unique tangent cone at infinity. Journal ...