Faster Algorithms via Approximation Theory

Illustrates how classical and modern techniques from approximation theory play a crucial role in obtaining results that are relevant to the emerging theory of fast algorithms. This book is self-contained and should be of interest to researchers and students in theoretical computer science, numerical linear algebra, and related areas.