{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:42:57Z","timestamp":1740109377655,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T00:00:00Z","timestamp":1712275200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T00:00:00Z","timestamp":1712275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1388\/16","1122\/22"],"award-info":[{"award-number":["1388\/16","1122\/22"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2024,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In the well known planted clique problem, a clique (or alternatively, an independent set) of size <jats:italic>k<\/jats:italic> is planted at random in an Erdos-Renyi random <jats:italic>G<\/jats:italic>(<jats:italic>n<\/jats:italic>,\u00a0<jats:italic>p<\/jats:italic>) graph, and the goal is to design an algorithm that finds the maximum clique (or independent set) in the resulting graph. We introduce a variation on this problem, where instead of planting the clique at random, the clique is planted by an adversary who attempts to make it difficult to find the maximum clique in the resulting graph. We show that for the standard setting of the parameters of the problem, namely, a clique of size <jats:inline-formula><jats:alternatives><jats:tex-math>$$k = \\sqrt{n}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>k<\/mml:mi>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:msqrt>\n                      <mml:mi>n<\/mml:mi>\n                    <\/mml:msqrt>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> planted in a random <jats:inline-formula><jats:alternatives><jats:tex-math>$$G(n, \\frac{1}{2})$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>G<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>n<\/mml:mi>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mfrac>\n                      <mml:mn>1<\/mml:mn>\n                      <mml:mn>2<\/mml:mn>\n                    <\/mml:mfrac>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> graph, the known polynomial time algorithms can be extended (in a non-trivial way) to work also in the adversarial setting. In contrast, we show that for other natural settings of the parameters, such as planting an independent set of size <jats:inline-formula><jats:alternatives><jats:tex-math>$$k=\\frac{n}{2}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>k<\/mml:mi>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mfrac>\n                      <mml:mi>n<\/mml:mi>\n                      <mml:mn>2<\/mml:mn>\n                    <\/mml:mfrac>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> in a <jats:italic>G<\/jats:italic>(<jats:italic>n<\/jats:italic>,\u00a0<jats:italic>p<\/jats:italic>) graph with <jats:inline-formula><jats:alternatives><jats:tex-math>$$p = n^{-\\frac{1}{2}}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:msup>\n                      <mml:mi>n<\/mml:mi>\n                      <mml:mrow>\n                        <mml:mo>-<\/mml:mo>\n                        <mml:mfrac>\n                          <mml:mn>1<\/mml:mn>\n                          <mml:mn>2<\/mml:mn>\n                        <\/mml:mfrac>\n                      <\/mml:mrow>\n                    <\/mml:msup>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, there is no polynomial time algorithm that finds an independent set of size <jats:italic>k<\/jats:italic>, unless NP has randomized polynomial time algorithms.<\/jats:p>","DOI":"10.1007\/s00224-024-10167-x","type":"journal-article","created":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T09:01:52Z","timestamp":1712307712000},"page":"773-813","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["How to Hide a Clique?"],"prefix":"10.1007","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-3749-4392","authenticated-orcid":false,"given":"Uriel","family":"Feige","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4781-1911","authenticated-orcid":false,"given":"Vadim","family":"Grinberg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,5]]},"reference":[{"issue":"3\u20134","key":"10167_CR1","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.0.CO;2-W","volume":"13","author":"N Alon","year":"1998","unstructured":"Alon, N., Krivelevich, M., Sudakov, B.: Finding a large hidden clique in a random graph. Random Struct. Algorithms 13(3\u20134), 457\u2013466 (1998)","journal-title":"Random Struct. Algorithms"},{"key":"10167_CR2","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF02785860","volume":"131","author":"N Alon","year":"2002","unstructured":"Alon, N., Krivelevich, M., Vu, V.H.: On the concentration of eigenvalues of random symmetric matrices. Isr. J. Math. 131, 259\u2013267 (2002). https:\/\/doi.org\/10.1007\/BF02785860","journal-title":"Isr. J. Math."},{"key":"10167_CR3","unstructured":"Bernstein, S.: Probability theory (In Russian), 4 edn. (1946)"},{"key":"10167_CR4","doi-asserted-by":"crossref","unstructured":"David, R., Feige, U.: On the effect of randomness on planted 3-coloring models. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, pp. 77\u201390 (2016)","DOI":"10.1145\/2897518.2897561"},{"issue":"1","key":"10167_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1017\/S096354831300045X","volume":"23","author":"Y Dekel","year":"2014","unstructured":"Dekel, Y., Gurel-Gurevich, O., Peres, Y.: Finding hidden cliques in linear time with high probability. Combinatorics, Probability & Computing 23(1), 29\u201349 (2014)","journal-title":"Combinatorics, Probability & Computing"},{"issue":"4","key":"10167_CR6","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1007\/s10208-014-9215-y","volume":"15","author":"Y Deshpande","year":"2015","unstructured":"Deshpande, Y., Montanari, A.: Finding hidden cliques of size $$\\sqrt{N\/e}$$ in nearly linear time. Found. Comput. Math. 15(4), 1069\u20131128 (2015)","journal-title":"Found. Comput. Math."},{"key":"10167_CR7","doi-asserted-by":"publisher","unstructured":"Feige, U.: Introduction to semi-random models. In: Roughgarden, T. (ed.) Beyond the Worst-Case Analysis of Algorithms. Cambridge University Press (2020). https:\/\/doi.org\/10.1017\/9781108637435","DOI":"10.1017\/9781108637435"},{"issue":"2","key":"10167_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/(SICI)1098-2418(200003)16:2<195::AID-RSA5>3.0.CO;2-A","volume":"16","author":"U Feige","year":"2000","unstructured":"Feige, U., Krauthgamer, R.: Finding and certifying a large hidden clique in a semirandom graph. Random Struct. Algorithms 16(2), 195\u2013208 (2000)","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"10167_CR9","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1137\/S009753970240118X","volume":"32","author":"U Feige","year":"2003","unstructured":"Feige, U., Krauthgamer, R.: The probable value of the Lov\u00e1sz-Schrijver relaxations for maximum independent set. SIAM J. Comput. 32(2), 345\u2013370 (2003)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10167_CR10","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1137\/060661090","volume":"22","author":"U Feige","year":"2008","unstructured":"Feige, U., Ofek, E.: Finding a maximum independent set in a sparse random graph. SIAM J. Discrete Math. 22(2), 693\u2013718 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"10167_CR11","doi-asserted-by":"crossref","unstructured":"Feige, U., Ron, D.: Finding hidden cliques in linear time. In: 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA\u201910), pp. 189\u2013204 (2010)","DOI":"10.46298\/dmtcs.2802"},{"key":"10167_CR12","doi-asserted-by":"publisher","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis, 2 edn. Cambridge University Press (2012). https:\/\/doi.org\/10.1017\/9781139020411","DOI":"10.1017\/9781139020411"},{"issue":"4","key":"10167_CR13","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1002\/rsa.3240030402","volume":"3","author":"M Jerrum","year":"1992","unstructured":"Jerrum, M.: Large cliques elude the metropolis process. Random Struct. Algorithms 3(4), 347\u2013360 (1992)","journal-title":"Random Struct. Algorithms"},{"key":"10167_CR14","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF02579314","volume":"2","author":"F Juh\u00e1sz","year":"1982","unstructured":"Juh\u00e1sz, F.: The asymptotic behaviour of Lov\u00e1sz\u2019 $$\\vartheta $$ function for random graphs. Combinatorica 2, 153\u2013155 (1982)","journal-title":"Combinatorica"},{"key":"10167_CR15","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0166-218X(94)00103-K","volume":"57","author":"L Kucera","year":"1995","unstructured":"Kucera, L.: Expected complexity of graph partitioning problems. Discrete Appl. Math. 57, 193\u2013212 (1995)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10167_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: On the Shannon capacity of a graph. IEEE Trans. Inform. Theory 25(1), 1\u20137 (1979)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10167_CR17","doi-asserted-by":"publisher","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: SWAT, pp. 260\u2013272 (2004). https:\/\/doi.org\/10.1007\/978-3-540-27810-8_23","DOI":"10.1007\/978-3-540-27810-8_23"},{"key":"10167_CR18","doi-asserted-by":"publisher","unstructured":"Meka, R., Potechin, A., Wigderson, A.: Sum-of-squares lower bounds for planted clique. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, STOC \u201915, pp. 87\u201396 (2015). https:\/\/doi.org\/10.1145\/2746539.2746600","DOI":"10.1145\/2746539.2746600"},{"key":"10167_CR19","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s00493-007-2190-z","volume":"27","author":"VH Vu","year":"2007","unstructured":"Vu, V.H.: Spectral norm of random matrices. Combinatorica 27, 721\u2013736 (2007). https:\/\/doi.org\/10.1007\/s00493-007-2190-z","journal-title":"Combinatorica"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10167-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-024-10167-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10167-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T21:17:23Z","timestamp":1724447843000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-024-10167-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,5]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["10167"],"URL":"https:\/\/doi.org\/10.1007\/s00224-024-10167-x","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2024,4,5]]},"assertion":[{"value":"21 February 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}