Algorithms & Data Structure
date
Apr 19, 2025
type
Post
AI summary
slug
algorithm
status
Published
tags
Algorithm
summary
This blog post provides an overview of key concepts in algorithms, starting with Dynamic Programming and Greedy Algorithms, exploring techniques like Divide and Conquer, Fourier Transform, and foundational theory on P and NP, NP-Completeness, and NP-Hard problems. It delves into Linear Programming and Integer Linear Programming, focusing on Approximation Algorithms and their applications, including TSP (Traveling Salesman Problem) approximation schemes. The post also covers advanced topics such as RSA Public Key Cryptography and the Basics of Quantum Computing, along with an introduction to advanced data structures, offering a comprehensive guide to important algorithmic techniques and their real-world applications.
Dynamic Programming, Greedy Algorithms
- Greedy Algorithms
Approximation Algorithms and Linear Programming
- Linear Programming
- Integer Linear Programming
- Approximation Algorithms
Advanced Data Structures, RSA and Quantum Algorithms
About Me
I'm Qiwei Mao, a geotechnical engineer with a passion for IoT systems. I'm exploring low-power microcontrollers and LoRa communication systems to enable both hobbyist remote monitoring solutions and industrial-grade monitoring or control systems.
This note series on Natural Language Processing documents my journey in the OMSCS Program at Georgia Institute of Technology.
