Tell your friends about this item:
Faster Algorithms via Approximation Theory - Foundations and Trends (R) in Theoretical Computer Science Sushant Sachdeva
Faster Algorithms via Approximation Theory - Foundations and Trends (R) in Theoretical Computer Science
Sushant Sachdeva
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.
108 pages
| Media | Books Paperback Book (Book with soft cover and glued back) |
| Released | March 31, 2014 |
| ISBN13 | 9781601988201 |
| Publishers | now publishers Inc |
| Pages | 108 |
| Dimensions | 156 × 234 × 6 mm · 163 g |
| Language | English |
See all of Sushant Sachdeva ( e.g. Paperback Book )