The ERC starting grant project “Finding Cracks in the Wall of NP-completeness” of PI Jesper Nederlof aims to improve classical algorithms for NP-hard problems. For example: Can the Bellman-Held-Karp dynamic programming algorithm from the 1960’s that solves TSP with n cities in 2^n time be improved to 1.9999^n time? Join the project as a postdoc now!

Website: https://www.uu.nl/en/organisation/working-at-utrecht-university/jobs/postdoc-position-in-algorithmic-theory-10-fte
Email: j.nederlof@uu.nl