Algorithms Illuminated: Omnibus Edition, Tim Roughgarden

Автор: Roughgarden, Tim
Название: Algorithms illuminated (part 2)
ISBN: 0999282921 ISBN-13(EAN): 9780999282922
Издательство: Неизвестно
Рейтинг:
Цена: 2757.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms Illuminated is an accessible introduction to the subject for anyone with at least a little programming experience. The exposition emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details---like a transcript of what an expert algorithms tutor would say over a series of one-on-one lessons. Part 2 covers graph search and applications, shortest paths, and the usage and implementation of several data structures (heaps, search trees, hash tables, and bloom filters).

Автор: Roughgarden Tim
Название: Algorithms Illuminated, Part 1: The Basics
ISBN: 0999282905 ISBN-13(EAN): 9780999282908
Издательство: Неизвестно
Цена: 2757.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Provides a conceptual approach that will encourage students learning algebra to employ a variety of thinking processes and strategies and, most importantly, will enable them to truly understand the concepts that underlie the problems they are solving. The book includes tasks focusing on algebraic expressions, equations, and functions, followed by tasks that integrate several mathematical concepts.

Автор: Roughgarden Tim
Название: Algorithms Illuminated (Part 4): Algorithms for NP-Hard Problems
ISBN: 0999282964 ISBN-13(EAN): 9780999282960
Издательство: Неизвестно
Рейтинг:
Цена: 3677.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

Fourth book in a series that provides an accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Includes hints of solutions to all quizzes and problems, and a series of YouTube videos by the author accompanies the book. Part 4 covers algorithmic tools for tackling NP-hard problems (heuristic algorithms, local search, dynamic programming, MIP and SAT solvers) and techniques for quickly recognizing NP-hard problems in the wild.