Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity
About this video
Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by videoExplores cohomology in Grothendieck topologies and lower bounds for Boolean circuit complexity. Teaches advanced mathematics with applications to computational complexity.
Video by Microsoft Research, played through YouTube's embedded player.