Computability, Complexity & Algorithms

We deal with fundamentals of computing and explore many different algorithms.

Georgia Tech Course Notes

• Computability and Complexity
• Church-Turing Thesis
• Undecidability
• Dynamic Programming
• Maximum Flow
• Bipartite Matching
• Fast Fourier Transform
• Approximation Algorithms
• Randomized Algorithms