@SimonsInstituteTOC
  @SimonsInstituteTOC
Simons Institute | Sparsifying Set Systems for Coverage Problems @SimonsInstituteTOC | Uploaded 1 week ago | Updated 1 day ago
Andrew McGregor (University of Massachusetts Amherst)
https://simons.berkeley.edu/talks/andrew-mcgregor-university-massachusetts-amherst-2024-08-02
Sublinear Graph Simplification

We will survey recent work on sparsifying set systems for coverage problems.
Sparsifying Set Systems for Coverage ProblemsA Strong Separation for Adversarially Robust L_0 Estimation for Linear SketchesDeciding regular games: a playground for exponential time algorithmsLightning TalkDescriptive complexity for distributed computing and neural networks

Sparsifying Set Systems for Coverage Problems @SimonsInstituteTOC

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER