Beyond worst-case analysis of algorithms
Publication details: Cambridge University Press, 2020. New York:Description: xv, 686 p. : ill. ; hb, 26 cmISBN:- 9781108494311
- 005.13 ROU
Item type | Current library | Collection | Call number | Copy number | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
![]() |
IIT Gandhinagar General Stacks | General | 005.13 ROU (Browse shelf(Opens below)) | 1 | Available | 029960 |
Browsing IIT Gandhinagar shelves, Shelving location: General Stacks, Collection: General Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
005.1 GLA Processing for visual artists: how to create expressive images and interactive art | 005.1 LOU Real-world algorithms: a beginner's guide | 005.13 LOU Algorithms | 005.13 ROU Beyond worst-case analysis of algorithms | 005.133 HIL Learning scientific programming with Python | 005.133 JAI Computer science with Python language made simple | 005.133 JAI Computer science with Python language made simple |
There are no silver bullets in algorithm design, and no single algorithmic idea is powerful and flexible enough to solve every computational problem. Nor are there silver bullets in algorithm analysis, as the most enlightening method for analyzing an algorithm often depends on the problem and the application. However, typical algorithms courses rely almost entirely on a single analysis framework, that of worst-case analysis, wherein an algorithm is assessed by its worst performance on any input of a given size. The purpose of this book is to popularize several alternatives to worst-case analysis and their most notable algorithmic applications, from clustering to linear programming to neural network training. Forty leading researchers have contributed introductions to different facets of this field, emphasizing the most important models and results, many of which can be taught in lectures to beginning graduate students in theoretical computer science and machine learning.
There are no comments on this title.