External Links

    Journal: Electronic Colloquium on Computational Complexity (ECCC)

    Volume 13, Issue 087

    0 -- 0Iordanis Kerenidis, Ran Raz. The one-way communication complexity of the Boolean Hidden Matching Problem
    runs on