Computer Science Bookscomputer algorithm Books

An Introduction to Computational Complexity

Advertisement

An Introduction to Computational Complexity

An Introduction to Computational Complexity

This note covers the following topics: Computational Models, Complexity measures, Power increasing resourses, Basic relatton amomg the models and measures, Reducibility, completeness and closure under reductions, Deterministics and nondeterministics logarithmic space, Deterministics polynomial time, Polynomial Hierarchy and Polynomial space.

Author(s):

s85 Pages

Advertisement

Advertisement

Similar Books
Design and Analysis of Algorithms Course Notes

Design and Analysis of Algorithms Course Notes

This note explains core material in data structures and algorithm design, and also helps students prepare for research in the field of algorithms. Topics covered includes: Splay Trees, Amortized Time for Splay Trees, Maintaining Disjoint Sets, Binomial heaps, F-heap, Minimum Spanning Trees, Fredman-Tarjan MST Algorithm, Light Approximate Shortest Path Trees, Matchings, Hopcroft-Karp Matching Algorithm, Two Processor Scheduling, Network Flow - Maximum Flow Problem, The Max Flow Problem and Max-Flow Algorithm.

s161 Pages
Purely Functional Data Structures

Purely Functional Data Structures

This note covers the following topics: Lazy Evaluation and S-Notation, Amortization and Persistence via Lazy Evaluation, Eliminating Amortization, Lazy Rebuilding, Numerical Representations, Data-Structural Bootstrapping, Implicit Recursive Slowdown.

s162 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
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.

sNA Pages
Computer Animation Algorithms  Techniques (Rick Parent)

Computer Animation Algorithms Techniques (Rick Parent)

Currently this section contains no detailed description for the page, will update this page soon.

s Pages
Handbook of Algorithms and Data Structures (G. Gonnet, R. Baeza Yates)

Handbook of Algorithms and Data Structures (G. Gonnet, R. Baeza Yates)

Currently this section contains no detailed description for the page, will update this page soon.

s Pages
Dictionary of Algorithms and Data Structures

Dictionary of Algorithms and Data Structures

Currently this section contains no detailed description for the page, will update this page soon.

s Pages