Akademibokhandeln
Tim Roughgarden - Beyond the Worst-Case Analysis of Algorithms, Inbunden

Inbunden, Engelska, 2021

Beyond the Worst-Case Analysis of Algorithms

Av Tim Roughgarden

1309 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Beskrivning
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.
Produktinformation
  • Utgivningsdatum: 2021-01-14
  • Mått: 188 x 260 x 40 mm
  • Vikt: 1 400 g
  • Format: Inbunden
  • Språk: Engelska
  • Antal sidor: 704
  • Förlag: Cambridge University Press
  • ISBN: 9781108494311
Utforska kategorier
Mer information

Tim Roughgarden is a Professor of Computer Science at Columbia University. For his research, he has been awarded the ACM Grace Murray Hopper Award, the Presidential Early Career Award for Scientists and Engineers (PECASE), the Kalai Prize in Computer Science and Game Theory, the Social Choice and Welfare Prize, the Mathematical Programming Society's Tucker Prize, and the EATCS-SIGACT Gödel Prize. He was an invited speaker at the 2006 International Congress of Mathematicians, the Shapley Lecturer at the 2008 World Congress of the Game Theory Society, and a Guggenheim Fellow in 2017. His other books include Twenty Lectures on Algorithmic Game Theory (2016) and the Algorithms Illuminated book series (2017-2020).

Recensioner i media

'Many important algorithmic problems are considered intractable according to the conventional worst-case metrics of computational complexity theory. This important book demonstrates that, for many such problems, it is possible to craft algorithms that perform well under plausible assumptions about the structure of the inputs that are likely to be presented. It may well mark a turning point in the field of algorithm design and analysis.' Richard M. Karp, University of California at Berkeley

Butikslager

Ej i lager i butik.

Betyg & recensioner

0 recensioner

Inga recensioner tillgängliga.