activity
20182023
most citedAn Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with O(logn) Query Time

5 citations · 8 across the 8 of their papers we have counts for

collaborators
Showing 2021Show all

1 paper · 1 filter

cs.CC2021

The PCP-like Theorem for Sub-linear Time Inapproximability

Hengzhao Ma, Jianzhong Li

In this paper we propose the PCP-like theorem for sub-linear time inapproximability. Abboud et al. have devised the distributed PCP framework for proving sub-quadratic time inappro…