An Introduction to the Analysis of Algorithms
Michael Soltys (2018)
A successor to the first and second editions, this updated and revised book is a leading companion guide for students and engineers alike, specifically software engineers who design algorithms. While succinct, this edition is mathematically rigorous, covering the foundations for both computer scientists and mathematicians with interest in the algorithmic foundations of Computer Science. Besides expositions on traditional algorithms such as Greedy, Dynamic Programming and Divide & Conquer, the book explores two classes of algorithms that are often overlooked in introductory textbooks: Randomised and Online algorithms with emphasis placed on the algorithm itself. The book also covers algorithms in Linear Algebra, and the foundations of Computation.
Michael Soltys (2018)
A successor to the first and second editions, this updated and revised book is a leading companion guide for students and engineers alike, specifically software engineers who design algorithms. While succinct, this edition is mathematically rigorous, covering the foundations for both computer scientists and mathematicians with interest in the algorithmic foundations of Computer Science. Besides expositions on traditional algorithms such as Greedy, Dynamic Programming and Divide & Conquer, the book explores two classes of algorithms that are often overlooked in introductory textbooks: Randomised and Online algorithms with emphasis placed on the algorithm itself. The book also covers algorithms in Linear Algebra, and the foundations of Computation.
Скрытое содержимое могут видеть только пользователи групп(ы): Premium, Местный, Свои
