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
Computational Complexity: Theory and Applications
Description
This lecture delves into the intricacies of computational complexity, exploring topics such as NP-completeness, polynomial reductions, and conjunctive normal form. The instructor explains the significance of these concepts in the context of theoretical computer science.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.