Fortell venner om denne varen:
Faster Algorithms via Approximation Theory - Foundations and Trends (R) in Theoretical Computer Science Sushant Sachdeva
Har du en profil? Logg inn
Få varsel om nye utgivelser fra Sushant Sachdeva
Legg til iMusic ønskeliste
eller
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 | Bøker Pocketbok (Bok med mykt omslag og limt rygg) |
| Utgitt | 31. mars 2014 |
| ISBN13 | 9781601988201 |
| Utgivere | now publishers Inc |
| Antall sider | 108 |
| Mål | 156 × 234 × 6 mm · 163 g |
| Språk | Engelsk |