YoVDO

Revisiting Trade-Offs and Impossibility Theorems

Offered By: Association for Computing Machinery (ACM) via YouTube

Tags

ACM FAccT Conference Courses Algorithm Design Courses Theoretical Computer Science Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore cutting-edge research in a thought-provoking paper session that delves into the complexities of trade-offs and impossibility theorems in computer science. Gain insights into the latest advancements and challenges in the field as experts present their findings and discuss the implications for future research and applications. Engage with innovative ideas that push the boundaries of theoretical computer science and challenge conventional wisdom.

Syllabus

Paper session 2: Revisiting Trade-Offs and Impossibility Theorems


Taught by

ACM FAccT Conference

Related Courses

Natural Language Processing
Columbia 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