{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,16]],"date-time":"2026-09-16T05:24:59Z","timestamp":1789536299071,"version":"build-2803163510"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,14]],"date-time":"2015-06-14T00:00:00Z","timestamp":1434240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1217793"],"award-info":[{"award-number":["1217793"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,14]]},"DOI":"10.1145\/2746539.2746577","type":"proceedings-article","created":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T11:35:56Z","timestamp":1433331356000},"page":"77-86","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["On the Complexity of Random Satisfiability Problems with Planted Solutions"],"prefix":"10.1145","author":[{"given":"Vitaly","family":"Feldman","sequence":"first","affiliation":[{"name":"IBM Research - Almaden, San Jose, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Will","family":"Perkins","sequence":"additional","affiliation":[{"name":"University of Birmingham, Birmingham, England UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Santosh","family":"Vempala","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.11"},{"key":"e_1_3_2_1_2_1","volume-title":"Hiding satisfying assignments: Two are better than one. J. Artif. Intell. Res.(JAIR), 24:623--639","author":"Achlioptas D.","year":"2005","unstructured":"D. Achlioptas , H. Jia , and C. Moore . Hiding satisfying assignments: Two are better than one. J. Artif. Intell. Res.(JAIR), 24:623--639 , 2005 . D. Achlioptas, H. Jia, and C. Moore. Hiding satisfying assignments: Two are better than one. J. Artif. Intell. Res.(JAIR), 24:623--639, 2005."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-011-0029-x"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214050"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806715"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_34"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422460"},{"key":"e_1_3_2_1_8_1","volume-title":"Hiding solutions in random satisfiability problems: A statistical mechanics approach. Physical review letters, 88(18):188701","author":"Barthel W.","year":"2002","unstructured":"W. Barthel , A. K. Hartmann , M. Leone , F. Ricci-Tersenghi , M. Weigt , and R. Zecchina . Hiding solutions in random satisfiability problems: A statistical mechanics approach. Physical review letters, 88(18):188701 , 2002 . W. Barthel, A. K. Hartmann, M. Leone, F. Ricci-Tersenghi, M. Weigt, and R. Zecchina. Hiding solutions in random satisfiability problems: A statistical mechanics approach. Physical review letters, 88(18):188701, 2002."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.2307\/1970980"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1090.0388"},{"key":"e_1_3_2_1_11_1","volume-title":"Human computable passwords. CoRR, abs\/1404.0024","author":"Blocki J.","year":"2014","unstructured":"J. Blocki , M. Blum , A. Datta , and S. Vempala . Human computable passwords. CoRR, abs\/1404.0024 , 2014 . J. Blocki, M. Blum, A. Datta, and S. Vempala. Human computable passwords. CoRR, abs\/1404.0024, 2014."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065184"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195147"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_30"},{"key":"e_1_3_2_1_15_1","first-page":"335","volume-title":"Annales de l'institut Fourier","author":"Bonami A.","year":"1970","unstructured":"A. Bonami . \u00c9tude des coefficients de fourier des fonctions de l_p(g) . In Annales de l'institut Fourier , volume 20 , pages 335 -- 402 . Institut Fourier , 1970 . A. Bonami. \u00c9tude des coefficients de fourier des fonctions de l_p(g). In Annales de l'institut Fourier, volume 20, pages 335--402. Institut Fourier, 1970."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.22"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.39"},{"key":"e_1_3_2_1_18_1","first-page":"281","volume-title":"Proceedings of NIPS","author":"Chu C.-T.","year":"2006","unstructured":"C.-T. Chu , S. K. Kim , Y.-A. Lin , Y. Yu , G. Bradski , A. Y. Ng , and K. Olukotun . Map-reduce for machine learning on multicore . In Proceedings of NIPS , pages 281 -- 288 , 2006 . C.-T. Chu, S. K. Kim, Y.-A. Lin, Y. Yu, G. Bradski, A. Y. Ng, and K. Olukotun. Map-reduce for machine learning on multicore. In Proceedings of NIPS, pages 281--288, 2006."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v29:3"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/080730160"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.07.017"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_31"},{"issue":"1","key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the em algorithm","volume":"39","author":"Dempster A.","year":"1977","unstructured":"A. Dempster , N. Laird , and D. Rubin . Maximum likelihood from incomplete data via the em algorithm . Journal of the Royal Statistical Society, Series B , 39 ( 1 ): 1 -- 38 , 1977 . A. Dempster, N. Laird, and D. Rubin. Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society, Series B, 39(1):1--38, 1977.","journal-title":"Journal of the Royal Statistical Society, Series B"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-007-0068-9"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0095-7"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509985"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_45"},{"key":"e_1_3_2_1_28_1","unstructured":"V. Feldman. Unpublished manuscript. V. Feldman. Unpublished manuscript."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.12.024"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488692"},{"key":"e_1_3_2_1_31_1","volume-title":"Subsampled power iteration: a unified algorithm for block models and planted csp's. arXiv preprint arXiv:1407.2774","author":"Feldman V.","year":"2014","unstructured":"V. Feldman , W. Perkins , and S. Vempala . Subsampled power iteration: a unified algorithm for block models and planted csp's. arXiv preprint arXiv:1407.2774 , 2014 . V. Feldman, W. Perkins, and S. Vempala. Subsampled power iteration: a unified algorithm for block models and planted csp's. arXiv preprint arXiv:1407.2774, 2014."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/644108.644166"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970444096X"},{"key":"e_1_3_2_1_34_1","volume-title":"Performance of the survey propagation-guided decimation algorithm for the random nae-k-sat problem. arXiv preprint arXiv:1402.0052","author":"Gamarnik D.","year":"2014","unstructured":"D. Gamarnik and M. Sudan . Performance of the survey propagation-guided decimation algorithm for the random nae-k-sat problem. arXiv preprint arXiv:1402.0052 , 2014 . D. Gamarnik and M. Sudan. Performance of the survey propagation-guided decimation algorithm for the random nae-k-sat problem. arXiv preprint arXiv:1402.0052, 2014."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1990.10476213"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0653(04)00461-5"},{"key":"e_1_3_2_1_37_1","volume-title":"IACR Cryptology ePrint Archive","author":"Goldreich O.","year":"2000","unstructured":"O. Goldreich . Candidate one-way functions based on expander graphs. IACR Cryptology ePrint Archive , 2000 :63, 2000. O. Goldreich. Candidate one-way functions based on expander graphs. IACR Cryptology ePrint Archive, 2000:63, 2000."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.2307\/1912775"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374438"},{"key":"e_1_3_2_1_40_1","volume-title":"Cambridge University Press","author":"Janson S.","year":"1997","unstructured":"S. Janson . Gaussian Hilbert spaces. Cambridge University Press , 1997 . S. Janson. Gaussian Hilbert spaces. Cambridge University Press, 1997."},{"key":"e_1_3_2_1_41_1","first-page":"384","volume-title":"PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE","author":"Jia H.","unstructured":"H. Jia , C. Moore , and D. Strain . Generating hard satisfiable formulas by hiding solutions deceptively . In PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE , volume 20 , page 384 . Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999, 2005. H. Jia, C. Moore, and D. Strain. Generating hard satisfiable formulas by hiding solutions deceptively. In PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, volume 20, page 384. Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999, 2005."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293351"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"e_1_3_2_1_44_1","volume-title":"Reweighted belief propagation and quiet planting for random k-sat. arXiv preprint arXiv:1203.5521","author":"Krzakala F.","year":"2012","unstructured":"F. Krzakala , M. M\u00e9zard , and L. Zdeborov\u00e1 . Reweighted belief propagation and quiet planting for random k-sat. arXiv preprint arXiv:1203.5521 , 2012 . F. Krzakala, M. M\u00e9zard, and L. Zdeborov\u00e1. Reweighted belief propagation and quiet planting for random k-sat. arXiv preprint arXiv:1203.5521, 2012."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0703685104"},{"key":"e_1_3_2_1_46_1","volume-title":"Hiding quiet solutions in random constraint satisfaction problems. Physical review letters, 102(23):238701","author":"Krzakala F.","year":"2009","unstructured":"F. Krzakala and L. Zdeborov\u00e1 . Hiding quiet solutions in random constraint satisfaction problems. Physical review letters, 102(23):238701 , 2009 . F. Krzakala and L. Zdeborov\u00e1. Hiding quiet solutions in random constraint satisfaction problems. Physical review letters, 102(23):238701, 2009."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875554"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.04.002"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v29:1"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2014.9"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1987.10478458"},{"key":"e_1_3_2_1_52_1","unstructured":"L. Trevisan. Checking the quasirandomness of graphs and hypergraphs. http:\/\/terrytao.wordpress.com\/2008\/02\/15\/luca-trevisan-checking-the-quasirandomness-of-graphs-and-hypergraphs\/ February 2008. L. Trevisan. Checking the quasirandomness of graphs and hypergraphs. http:\/\/terrytao.wordpress.com\/2008\/02\/15\/luca-trevisan-checking-the-quasirandomness-of-graphs-and-hypergraphs\/ February 2008."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00940812"}],"event":{"name":"STOC '15: Symposium on Theory of Computing","location":"Portland Oregon USA","acronym":"STOC '15","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-seventh annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746539.2746577","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2746539.2746577","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:56:03Z","timestamp":1750258563000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746539.2746577"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,14]]},"references-count":53,"alternative-id":["10.1145\/2746539.2746577","10.1145\/2746539"],"URL":"https:\/\/doi.org\/10.1145\/2746539.2746577","relation":{},"subject":[],"published":{"date-parts":[[2015,6,14]]},"assertion":[{"value":"2015-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}