1 citations · 1 across the 4 of their papers we have counts for
Showing 2002Show all
2 papers · 1 filter
quant-ph2002
Quantum Time-Space Tradeoffs for Sorting
Hartmut Klauck
We investigate the complexity of sorting in the model of sequential quantum circuits. While it is known that in general a quantum algorithm based on comparisons alone cannot outper…
cs.CC2002
Rectangle Size Bounds and Threshold Covers in Communication Complexity
Hartmut Klauck
We investigate the power of the most important lower bound technique in randomized communication complexity, which is based on an evaluation of the maximal size of approximately mo…