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.
Lecture
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 basics of computational complexity, including temporal and spatial complexity, big O notation, and complexity classes such as P and NP. It also discusses the concept of deterministic and non-deterministic Turing machines.