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 discusses the concept of satisfiability threshold, clusters of solutions to satisfaction problems, and the role of parameter alpha in controlling problem difficulty. It also covers the computation of the average number of clusters a configuration belongs to and the definition of alpha d. The instructor explains how to find alpha d from an expression involving the number of clusters and how it relates to the expected value of configurations belonging to clusters.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace