Et si SAT était vraiment difficile? Quelques conséquences des hypothèses ETH - Lecture
Offered By: Centre International de Rencontres Mathématiques via YouTube
Course Description
Overview
Explore the implications of SAT complexity in this 58-minute conference talk by Bruno Escoffier, recorded during the "ALEA Days" thematic meeting at the Centre International de Rencontres Mathématiques in Marseille, France. Delve into the consequences of the Exponential Time Hypothesis (ETH) and related assumptions on SAT difficulty. Access this video and other mathematical talks through CIRM's Audiovisual Mathematics Library, featuring chapter markers, keywords, enriched content with abstracts and bibliographies, and a multi-criteria search function for easy navigation through various mathematical topics.
Syllabus
Bruno Escoffier : Et si SAT était vraiment difficile? Quelques conséquences des hypothèses ETH et...
Taught by
Centre International de Rencontres Mathématiques
Related Courses
A Parameterized Approximation Scheme for Min k-CutIEEE via YouTube Parameterized Complexity of Quantum Invariants of Knots
Applied Algebraic Topology Network via YouTube Sparse Integer Programming Is FPT
Hausdorff Center for Mathematics via YouTube Recent Hardness of Approximation Results in Parameterized Complexity
Hausdorff Center for Mathematics via YouTube Parametrized Algorithms and Possible Future Directions
Hausdorff Center for Mathematics via YouTube