Pastāsti draugiem par šo preci:
Faster Algorithms via Approximation Theory - Foundations and Trends (R) in Theoretical Computer Science Sushant Sachdeva
Do you have a profile? Pierakstīties
Saņemiet paziņojumus par jauniem Sushant Sachdeva izdevumiem
Mūsu klienti saka:
Pievienot savam iMusic vēlmju sarakstam
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
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2014. gada 31. marts |
| ISBN13 | 9781601988201 |
| Izdevēji | now publishers Inc |
| Lapas | 108 |
| Izmēri | 156 × 234 × 6 mm · 163 g |
| Valoda | Angļu |
