Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > DETAIL:

Paper:

TR06-087 | 25th July 2006 00:00

The one-way communication complexity of the Boolean Hidden Matching Problem

TR06-087
Authors: Iordanis Kerenidis, Ran Raz
Publication: 26th July 2006 19:14