7 citations · 7 across the 1 of their papers we have counts for
1 paper · 1 filter
Miklós Z. Rácz, Benjamin Schiffer
We consider a variant of the planted clique problem where we are allowed unbounded computational time but can only investigate a small part of the graph by adaptive edge queries. W…