Buy Beyond the Worst-Case Analysis of Algorithms - by Tim Roughgarden (Hardcover) in United States - Cartnear.com

Beyond the Worst-Case Analysis of Algorithms - by Tim Roughgarden (Hardcover)

CTNR908406 09781108494311 CTNR908406

Juvale

Juvale
2025-09-19 USD 69.35

$ 69.35 $ 71.49

Item Added to Cart

*Product availability is subject to suppliers inventory

Beyond the Worst-Case Analysis of Algorithms - by  Tim Roughgarden (Hardcover)
SHIPPING ALL OVER UNITED STATES
Beyond the Worst-Case Analysis of Algorithms - by  Tim Roughgarden (Hardcover)
100% MONEY BACK GUARANTEE
Beyond the Worst-Case Analysis of Algorithms - by  Tim Roughgarden (Hardcover)
EASY 30 DAYSRETURNS & REFUNDS
Beyond the Worst-Case Analysis of Algorithms - by  Tim Roughgarden (Hardcover)
24/7 CUSTOMER SUPPORT
Beyond the Worst-Case Analysis of Algorithms - by  Tim Roughgarden (Hardcover)
TRUSTED AND SAFE WEBSITE
Beyond the Worst-Case Analysis of Algorithms - by  Tim Roughgarden (Hardcover)
100% SECURE CHECKOUT
Number of Pages: 704
Genre: Computers + Internet
Sub-Genre: Programming
Format: Hardcover
Publisher: Cambridge University Press
Age Range: Adult
Book theme: Algorithms
Author: Tim Roughgarden
Language: English



About the Book



Introduces exciting new methods for assessing algorithms for problems ranging from clustering to linear programming to neural networks.



Book Synopsis



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.



Review Quotes




'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

'The worst-case analysis sets a criteria for perfect algorithmic performance. It has led and will continue to lead to the creation of breakthrough algorithms unthinkable by previous generations. But the success of worst-case analysis as the main theoretical computing framework has also placed provably-good algorithm design in a quandary, because nearly all practically significant problems have been shown to be intractable under such perfect criteria. Going beyond the worst-case analysis is a much-needed step for the theory of computing. This book - broad in scope and united by a common theme - represents diverse efforts in the field, and will elevate this fundamental subject for connecting computing theory with the rapid advances in Big Data and AI Solutions.' Shanghua Teng, University of Southern California

Related Products

See More