Innovations in Theoretical Computer Science 2020 - Session 10
Offered By: Paul G. Allen School via YouTube
Course Description
Overview
Explore cutting-edge research in theoretical computer science through this conference session from the Innovations in Theoretical Computer Science (ITCS) 2020 conference. Delve into six presentations covering diverse topics such as computational hardness in constrained PCA problems, the unexpected power of random strings, hardness magnification and locality in complexity theory, hardness amplification of optimization problems, pseudorandomness and minimum circuit size, and rigorous guarantees in decision tree induction. Chaired by Anna Gal, this session features talks by renowned researchers including Afonso S. Bandeira, Shuichi Hirahara, Lijie Chen, and others. Gain insights into new concepts, models, and techniques that are shaping the future of computer science research. Recorded on January 14, 2020, this 1 hour and 29 minute video includes closed captions for accessibility.
Syllabus
Innovations in Theoretical Computer Science 2020 Session 10 (1)
Taught by
Paul G. Allen School
Related Courses
Statistical Learning with RStanford University via edX The Analytics Edge
Massachusetts Institute of Technology via edX Machine Learning 1—Supervised Learning
Brown University via Udacity The Caltech-JPL Summer School on Big Data Analytics
California Institute of Technology via Coursera 機器學習技法 (Machine Learning Techniques)
National Taiwan University via Coursera