Open
Episode cover
YouTube19 Jul 2024
31m

Sublinear time algorithms for better than 1/2 approximation algorithms for max-cut on expanders

Podcast cover

Simons Institute

Open in Podwise to generate AI notes

Sign in to process this episode and unlock summaries, transcripts, highlights and translations.

Open in Podwise

Shownotes are not generated by Podwise.

Sublinear time algorithms for better than 1/2 approximation algorithms for max-cut on expanders