Neil gave a talk on the Traveling Salesman Problem (TSP), including the problem itself, NP-hardness (as well as briefly what it means to be in NP, NP-Hard, etc.), the DP algorithm for exact TSP, some variants, and approximation algorithms.
Previous: Cryptography
Neil gave a talk on cryptography (including topics like number theory and RSA).
continue reading ❯