Skip to content

Opening book details…

Can I read Algorithms on EtoBox?

Algorithms by Sariel Har-Peled is a mathematics available to read on EtoBox.

What is Algorithms about?

Preface Contents I NP Completeness NP Completeness I Introduction Complexity classes Reductions More NP-Complete problems 3SAT Bibliographical Notes NP Completeness II Max-Clique Independent Set Vertex Cover Graph Coloring NP Completeness III Hamiltonian Cycle Traveling Salesman Problem Subset Sum 3 dimensional Matching (3DM) Partition Some other problems II Dynamic programming Dynamic programming Basic Idea - Partition Number A Short sermon on memoization Example – Fibonacci numbers Why, where, and when? Computing Fibonacci numbers Edit Distance Shortest path in a DAG and dynamic programming Dynamic programming II - The Recursion Strikes Back Optimal search trees Optimal Triangulations Matrix Multiplication Longest Ascending Subsequence Pattern Matching Slightly faster TSP algorithm via dynamic programming III Approximation algorithms Approximation algorithms Greedy algorithms and approximation algorithms Alternative algorithm – two for the price of one Fixed parameter tractability, approximation, and fast exponential time algorithms (to say nothing of the dog) A silly brute force algorithm for vertex cover A fixed parameter tractable algorithm Remarks Approximating maximum matchi

Who reads Algorithms?

It is typically read by self-directed learners exploring a subject in depth.

Common subject areas: history, science, philosophy, social sciences.

Author
Sariel Har-Peled
Publisher
University of Illinois
Published
2019
Language
EN
Category
mathematics
Subjects
Mathematics, Computer Science, Programming
Rating
4.21 / 5 (275 ratings)
Updated
2026-03-14

More by Sariel Har-Peled

Browse all works by Sariel Har-Peled

Similar books