1 citations · 1 across the 4 of their papers we have counts for
Showing 2001Show all
3 papers · 1 filter
cs.CC2001
One-way communication complexity and the Neciporuk lower bound on formula size
Hartmut Klauck
In this paper the Neciporuk method for proving lower bounds on the size of Boolean formulae is reformulated in terms of one-way communication complexity. We investigate the scenari…
quant-ph2001
On quantum and approximate privacy
Hartmut Klauck
This paper studies privacy and secure function evaluation in communication complexity. The focus is on quantum versions of the model and on protocols with only approximate privacy…
quant-ph2001
Lower bounds for quantum communication complexity
Hartmut Klauck
We prove new lower bounds for bounded error quantum communication complexity. Our methods are based on the Fourier transform of the considered functions. First we generalize a meth…