An Average-Degree Bound for Hamming Hypergraphs, with Applications to Optimal PAC...- Nataly Brukhim
About this video
Advanced · Editorial review · 85% confidenceInstitute for Advanced Study is already on Lumen; this upload was never considered before. Channel treated as academic (strict check, default pass); title passed a strict per-title check and a final strict pass; oEmbed verified.
A 111-minute video from Institute for Advanced Study: “An Average-Degree Bound for Hamming Hypergraphs, with Applications to Optimal PAC...- Nataly Brukhim”.
Video by Institute for Advanced Study, played through YouTube's embedded player.