5 citations · 6 across the 5 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2020
On Hardness of Approximation of Parameterized Set Cover and Label Cover: Threshold Graphs from Error Correcting Codes
Karthik C. S., Inbal Livni-Navon
In the -SetCover problem, we are given a collection of sets over a universe , and the goal is to distinguish between the case that contains $k…
cs.CC2018
List Decoding with Double Samplers
Irit Dinur, Prahladh Harsha, Tali Kaufman +2
We strengthen the notion of "double samplers", first introduced by Dinur and Kaufman [Proc. 58th FOCS, 2017], which are samplers with additional combinatorial properties, and whose…
cs.CC2016★ 1 cited
Cube vs. Cube Low Degree Test
Amey Bhangale, Irit Dinur, Inbal Livni Navon
We revisit the Raz-Safra plane-vs.-plane test and study the closely related cube vs. cube test. In this test the tester has access to a "cubes table" which assigns to every cube a…