Bridging the gap between complex scientific research and the curious minds eager to explore it.

Tag: a simpler and parallelizable o(√log n)-approximation algorithm for sparsest cut

Page 1/1