13 citations · 25 across the 15 of their papers we have counts for
Showing 2023 · cs.DSShow all
2 papers · 2 filters
cs.DS2023
Testing Graph Properties with the Container Method
Eric Blais, Cameron Seth
We establish nearly optimal sample complexity bounds for testing the -clique property in the dense graph model. Specifically, we show that it is possible to distinguish graphs o…
cs.DS2023
Testing and Learning Convex Sets in the Ternary Hypercube
Hadley Black, Eric Blais, Nathaniel Harms
We study the problems of testing and learning high-dimensional discrete convex sets. The simplest high-dimensional discrete domain where convexity is a non-trivial property is the…