Preprint
Sep 2026
Optimal Passes and Perfect Sampling for Similarity Graph Statistics
Matching lower bounds up to polylogarithmic factors show that both the number of passes and the polynomial dependence on $n$ are optimal.
Qin Zhang
· 0 citations