Conditional Hardness and Fine-grained Complexity
Offered By: Simons Institute via YouTube
Course Description
Overview
Explore the concepts of conditional hardness and fine-grained complexity in this one-hour lecture presented by Ce Jin and Yinzhan Xu from MIT as part of the Data Structures and Optimization for Fast Algorithms Boot Camp at the Simons Institute. Delve into advanced algorithmic analysis techniques and gain insights into the intricate relationships between problem difficulty and computational efficiency.
Syllabus
Conditional Hardness and Fine-grained Complexity
Taught by
Simons Institute
Related Courses
Natural Language ProcessingColumbia University via Coursera Intro to Algorithms
Udacity Conception et mise en œuvre d'algorithmes.
École Polytechnique via Coursera Paradigms of Computer Programming
Université catholique de Louvain via edX Data Structures and Algorithm Design Part I | 数据结构与算法设计(上)
Tsinghua University via edX