Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes
Offered By: IEEE via YouTube
Course Description
Overview
Explore a 25-minute IEEE conference talk on deterministic and efficient interactive coding derived from hard-to-decode tree codes, presented by experts Zvika Brakerski from Weizmann Institute, Yael Tauman Kalai from Microsoft and MIT, and Raghuvansh Saxena from Princeton University. Delve into the intricacies of this advanced topic in computer science and cryptography, gaining insights into the latest research and developments in interactive coding techniques.
Syllabus
Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Information TheoryThe Chinese University of Hong Kong via Coursera Fundamentals of Electrical Engineering
Rice University via Coursera Computational Neuroscience
University of Washington via Coursera Introduction to Complexity
Santa Fe Institute via Complexity Explorer Tutorials for Complex Systems
Santa Fe Institute via Complexity Explorer