YoVDO

Et si SAT était vraiment difficile? Quelques conséquences des hypothèses ETH - Lecture

Offered By: Centre International de Rencontres Mathématiques via YouTube

Tags

Computational Complexity Courses Algorithm Design Courses NP-completeness Courses Fine-Grained Complexity Courses Parameterized Complexity Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Algorithms: Design and Analysis, Part 2
Stanford University via Coursera
Intro to Theoretical Computer Science
Udacity
算法设计与分析(高级) | Advanced Design and Analysis of Algorithms
Peking University via edX
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Stanford University via Coursera
Algorithm Design and Analysis
University of Pennsylvania via edX