Skip to content

Session 8A - New Hardness Results for Planar Graph Problems in P and an Algorithm for Sparsest Cut

289 views

Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.

Part of STOC 2020