23 citations · 36 across the 5 of their papers we have counts for
1 paper · 1 filter
Jaikumar Radhakrishnan, Pranab Sen, S. Venkatesh
We study the quantum complexity of the static set membership problem: given a subset S (|S| \leq n) of a universe of size m (m \gg n), store it as a table of bits so that queries o…