Computer Science Bookscomputer algorithm Books

Introduction to Complexity Theory (Oded Goldreich)

Advertisement

Introduction to Complexity Theory (Oded Goldreich)

Introduction to Complexity Theory (Oded Goldreich)

This book explains the following topics: intrinsic complexity of computational tasks, Computational Complexity, P, NP, and NP-Completeness, relations between various computational phenomena.

Author(s):

sNA Pages
Similar Books
Advanced Algorithms by Anupam Gupta

Advanced Algorithms by Anupam Gupta

The PDF covers the following topics related to Computer Algorithms : Discrete Algorithms, Minimum Spanning Trees, Arborescences: Directed Spanning Trees, Dynamic Algorithms for Graph Connectivity, Shortest Paths in Graphs, Low-Stretch Spanning Trees, Graph Matchings I: Combinatorial Algorithms, Graph Matchings II: Weighted Matchings, Graph Matchings III: Algebraic Algorithms, The Curse of Dimensionality, and Dimension Reduction, Dimension Reduction and the JL Lemma, Streaming Algorithms, Dimension Reduction: Singular Value Decompositions, From Discrete to Continuous Algorithms, Online Learning: Experts and Bandits, Solving Linear Programs using Experts, Approximate Max-Flows using Experts, The Gradient Descent Framework, Mirror Descent, The Centroid and Ellipsoid Algorithms, Interior-Point Methods, Combating Intractability, Approximation Algorithms via SDPs, Online Algorithms, Additional Topics, Prophets and Secretaries.

s309 Pages
Design And Analysis Of Algorithms by Herbert Edelsbrunner

Design And Analysis Of Algorithms by Herbert Edelsbrunner

This book focuses on fundamental data structures and graph algorithms. The emphasis will be on algorithm design and on algorithm analysis.

s95 Pages
Approximation Algorithms

Approximation Algorithms

The field of approximation algorithms has developed in response to the difficulty in solving a good many optimization problems exactly. This note will present general techniques that underly these algorithms.

sNA Pages
Introduction to Algorithms by Shayan Oveis Gharan

Introduction to Algorithms by Shayan Oveis Gharan

This book explains the following topics: Stable Matchings, Algrithm Design by Induction, Graphs, Trees or BFS, Connected Comps/Bipartite Graphs, DFS or Topological Ordering, Interval Scheduling, Interval Partitioning, MST, MST, Union find, Closest Points, Master Theorem, Integer Multiplication, Median, Vertex Cover or Set Cover, Network Connectivity, Image Segmentation, Reductions, NP-Completeness, Linear Programming.

sNA Pages
Design and Analysis of Algorithms

Design and Analysis of Algorithms

This is an intermediate algorithms course note with an emphasis on teaching techniques for the design and analysis of efficient algorithms, emphasizing methods of application. Topics include divide-and-conquer, randomization, dynamic programming, greedy algorithms, incremental improvement, complexity, and cryptography.

sNA Pages
Introduction to Algorithms

Introduction to Algorithms

In computer science, an algorithm is a self-contained step-by-step set of operations to be performed. Topics covered includes: Algorithmic Primitives for Graphs, Greedy Algorithms, Divide and Conquer, Dynamic Programming, Network Flow, NP and Computational Intractability, PSPACE, Approximation Algorithms, Local Search, Randomized Algorithms.

s459 Pages
Applied Algorithms Lecture Slides

Applied Algorithms Lecture Slides

This note covers the following topics: Introduction, Stable Matching, Graph Algorithms, Greedy Algorithms, Minimum Spanning Trees, Recurrences, Dynamic programming, Network Flow and Network Flow Applications.

sNA Pages
Design and Analysis of Computer Algorithms (PDF 135P)

Design and Analysis of Computer Algorithms (PDF 135P)

This lecture note discusses the approaches to designing optimization algorithms, including dynamic programming and greedy algorithms, graph algorithms, minimum spanning trees, shortest paths, and network flows. Also it briefly discusses algorithmic problems arising from geometric settings, that is, computational geometry.

s135 Pages
Computer Programming Algorithms Directory

Computer Programming Algorithms Directory

This note covers the following topics: Encryption Algorithms, Genetic Algorithms, Geographic Information Systems Algorithms, Sorting Algorithms, Search Algorithms, Tree Algorithms, Computational Geometry Algorithms, Phonetic Algorithms and Project Management Algorithms.

sNA Pages
Efficient Algorithms for Sorting and Synchronization (Andrew Tridgell, PDF)

Efficient Algorithms for Sorting and Synchronization (Andrew Tridgell, PDF)

This thesis presents efficient algorithms for internal and external parallel sorting and remote data update. Topics covered includes: Internal Parallel Sorting, External Parallel Sorting, The rsync algorithm, rsync enhancements and optimizations and Further applications for rsync.

s115 Pages

Advertisement