A Simple Proof of a New Set Disjointness with Applications to Data Streams - Akshay Kamath

Whole-channel inclusion: Computational Complexity Conference (title sample: This is a recorded academic conference channel where nearly every upload is a full technical research talk on computational complexity theory, clearly educational primary-source content.; 0 of 3 sampled transcripts read as real teaching); this title passed a strict title check.

A 28-minute video from Computational Complexity Conference: “A Simple Proof of a New Set Disjointness with Applications to Data Streams - Akshay Kamath”.

Video by Computational Complexity Conference, played through YouTube's embedded player.