Rivest's optimality conjecture for correlated sampling
Statement
Let , let denote the uniform distribution on a finite set , and let be probabilistic strategies satisfying the correctness condition for correlated sampling. For positive integers with and , consider sets with , , and . Rivest's conjecture. For every such and every pair , there exist sets with these sizes such that
This conjecture asserts that Broder's MinHash correlated-sampling strategy is optimal except in the case of intersection size one covered by Rivest's protocol. The paper's main result proves the asserted lower bound for constant-fraction intersections, while the fully general statement remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.