YoVDO

Communication Complexity, Streaming and Computational Assumptions

Offered By: Simons Institute via YouTube

Tags

Cryptography Courses Algorithm Optimization Courses

Course Description

Overview

Explore the intersection of computational limitations and algorithmic improvements in this lecture by Moni Naor from the Weizmann Institute of Science. Delve into examples where assuming computational constraints on adversaries and utilizing specific cryptographic tools can overcome established impossibility results in communication complexity and streaming. Examine the potential necessity of these tools for achieving such results and consider open problems in the field. Learn about joint research with Boaz Menuhin and Shahar Cohen, focusing on minimal complexity assumptions for cryptography and their implications for communication complexity and streaming algorithms.

Syllabus

Communication Complexity, Streaming and Computational Assumptions


Taught by

Simons Institute

Related Courses

LAFF-On Programming for High Performance
The University of Texas at Austin via edX
Машинное обучение на больших данных
Higher School of Economics via Coursera
Machine Learning with Javascript
Udemy
Améliorez les réseaux neuronaux profonds
DeepLearning.AI via Coursera
How To Build A Brand On Social Media!
Skillshare