Ohad Klein "Slicing all edges of an n-cube requires n^2/3 hyperplanes"

About this video

Advanced · Editorial review · 85% confidence

Round-16 hunt: picked; source: named-course long-video search (r16 wave 4); channel screens (sellers/exam/re-upload/devotional/vendor/events), provenance check, vendor/seller/devotional recheck and quality tier C + tier-C depth check passed; strict per-title check + final strict pass; oEmbed verified.

A 55-minute video from Probability and Analysis Webinar: “Ohad Klein "Slicing all edges of an n-cube requires n^2/3 hyperplanes"”.

Video by Probability and Analysis Webinar, played through YouTube's embedded player.