External Links

    Journal: Electronic Colloquium on Computational Complexity (ECCC)

    Volume 13, Issue 050

    0 -- 0Alexander A. Razborov, Sergey Yekhanin. An Omega(n^{1/3}) Lower Bound for Bilinear Group Based Private Information Retrieval
    runs on