Theorem 2 in the main paper introduces the asymptotic complexity of our proposed randomized bilinear hashing scheme BH-Hash. For self-contained consideration, here we provide the proof, which is basically following the technique previously used in the proof of Theorem 1 in (Gionis et al., 1999). Recall that in Theorem 1 of the main paper, we have shown that the proposed BH-Hash is (r, r(1 + ǫ),...
