Computability, Complexity & Algorithms

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

Georgia Tech Course Notes

• Computability
• Computability
• Randomized Algorithms
• Bipartite Matching
• Maximum Flow
• Fast Fourier Transform
• Dynamic Programming

Resources

• Notes in PDF: https://drive.google.com/drive/u/1/folders/0Bw223ejhCropYzdVTHNQaVQzdDQ