Mathematics
and Interactions
-
Videos linked to 68Q17 Computational difficulty of problemsMore +
![Derandomization, tutorial - part 2: Meta-complexity]()
01:08:25published on March 11, 2024Derandomization, tutorial - part 2: Meta-complexity
By Valentine Kabanets
![Derandomization, tutorial - part 1: Pseudo-randomness from hardness]()
01:14:33published on March 11, 2024Derandomization, tutorial - part 1: Pseudo-randomness from hardness
By Valentine Kabanets
![Et si SAT était vraiment difficile? Quelques conséquences des hypothèses ETH et SETH]()
57:38published on March 28, 2023Et si SAT était vraiment difficile? Quelques conséquences des hypothèses ETH et SETH
By Bruno Escoffier
![Algorithmic aspects of embeddability: higher-dimensional analogues of graph planarity]()
01:40:06published on May 26, 2016Algorithmic aspects of embeddability: higher-dimensional analogues of graph planarity
By Uli Wagner
