8 citations · 12 across the 4 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.CC2020
Is the space complexity of planted clique recovery the same as that of detection?
Jay Mardia
We study the planted clique problem in which a clique of size k is planted in an Erdős-Rényi graph G(n, 1/2), and one is interested in either detecting or recovering this planted c…
cs.CC2020★ 4 cited
Finding Planted Cliques in Sublinear Time
Jay Mardia, Hilal Asi, Kabir Aladin Chandrasekher
We study the planted clique problem in which a clique of size k is planted in an Erdos-Renyi graph G(n,1/2) and one is interested in recovering this planted clique. It is widely be…