Gør som tusindvis af andre bogelskere
Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.
Ved tilmelding accepterer du vores persondatapolitik.Du kan altid afmelde dig igen.
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.
Illustrates the emerging paradigm of employing Laplacian solvers to design novel fast algorithms for graph problems through a small but carefully chosen set of examples. A significant part of this book is also dedicated to developing the ideas that go into the construction of near-linear time Laplacian solvers.
Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.
Ved tilmelding accepterer du vores persondatapolitik.