Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the fundamentals of computational complexity, including tractable and intractable problems, decision problems, complexity classes, quantum computational complexity, and NP-hard and NP-complete problems. It also delves into the concept of Merlin-Arthur protocols and probabilistic algorithms.