@article{a41e23ef65bc4eb5859b95ca0e48872d,
title = "Finding cliques using few probes",
abstract = "Consider algorithms with unbounded computation time that probe the entries of the adjacency matrix of an n vertex graph, and need to output a clique. We show that if the input graph is drawn at random from Gn,12 (and hence is likely to have a clique of size roughly 2logn), then for every delta l, there is an alpha",
author = "Uriel Feige and David Gamarnik and Joe Neeman and Racz, \{Miklos Z.\} and Prasad Tetali",
note = "This research was supported by the NSF, DMS 1811724. DMS‐1407657. DMS‐1811935; Israel Science Foundation (grant No. 1388/16) to [U.F.]; ONR grant N00014‐17‐1‐2790 to [D.G.]; Alfred P. Sloan Foundation to [J.N.]; National Science Foundation (NSF) grant DMS 1811724 to [M.Z.R.]; National Science Foundation (NSF) grants DMS 1407657 and DMS 1811935 to [P.T.].",
year = "2019",
month = dec,
day = "17",
doi = "10.1002/rsa.20896",
language = "الإنجليزيّة",
volume = "56",
pages = "142--153",
journal = "Random Structures \& Algorithms",
issn = "1042-9832",
publisher = "John Wiley and Sons Ltd",
number = "1",
}