Login / Signup
An Omega(n^{1/3}) Lower Bound for Bilinear Group Based Private Information Retrieval.
Alexander A. Razborov
Sergey Yekhanin
Published in:
Electron. Colloquium Comput. Complex. (2006)
Keyphrases
</>
lower bound
upper bound
private information retrieval
objective function
branch and bound algorithm
optimal solution
sufficiently accurate
databases
information sources
data quality