{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:05:27Z","timestamp":1750694727179,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,19]],"date-time":"2016-06-19T00:00:00Z","timestamp":1466294400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,19]]},"DOI":"10.1145\/2897518.2897561","type":"proceedings-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T13:04:07Z","timestamp":1465563847000},"page":"77-90","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["On the effect of randomness on planted 3-coloring models"],"prefix":"10.1145","author":[{"given":"Roee","family":"David","sequence":"first","affiliation":[{"name":"Weizmann Institute of Science, Israel"}]},{"given":"Uriel","family":"Feige","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Israel"}]}],"member":"320","published-online":{"date-parts":[[2016,6,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(88)90189-6"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794270248"},{"key":"e_1_3_2_1_3_1","volume-title":"The probabilistic method","author":"Alon Noga","year":"2004","unstructured":"Noga Alon and Joel H Spencer . The probabilistic method . John Wiley & amp; Sons, 2004 . Noga Alon and Joel H Spencer. The probabilistic method. John Wiley & Sons, 2004."},{"volume-title":"Planted random 3SAT with a small fraction of 1-clauses. MSC Thesis","author":"Arbitman Alina","key":"e_1_3_2_1_4_1","unstructured":"Alina Arbitman . Planted random 3SAT with a small fraction of 1-clauses. MSC Thesis , Weizmann Institute , http:\/\/www.wisdom.weizmann.ac.il\/\u223cfeige\/ TechnicalReports\/AlinaArbitmanThesis.pdf, 2012. Alina Arbitman. Planted random 3SAT with a small fraction of 1-clauses. MSC Thesis, Weizmann Institute, http:\/\/www.wisdom.weizmann.ac.il\/\u223cfeige\/ TechnicalReports\/AlinaArbitmanThesis.pdf, 2012."},{"key":"e_1_3_2_1_5_1","first-page":"12","volume-title":"Algorithms and Techniques","author":"Arora Sanjeev","unstructured":"Sanjeev Arora and Rong Ge . New tools for graph coloring. In Approximation, Randomization, and Combinatorial Optimization . Algorithms and Techniques , pages 1\u2013 12 . Springer, 2011. Sanjeev Arora and Rong Ge. New tools for graph coloring. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pages 1\u201312. Springer, 2011."},{"key":"e_1_3_2_1_6_1","volume-title":"Matrix analysis","author":"Bhatia Rajendra","year":"2013","unstructured":"Rajendra Bhatia . Matrix analysis , volume 169 . Springer Science & amp; Business Media, 2013 . Rajendra Bhatia. Matrix analysis, volume 169. Springer Science & Business Media, 2013."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.1034"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.22"},{"key":"e_1_3_2_1_9_1","first-page":"197","volume-title":"Mathematical Proceedings of the Cambridge Philosophical Society","volume":"37","author":"Brooks Rowland Leonard","unstructured":"Rowland Leonard Brooks . On colouring the nodes of a network . In Mathematical Proceedings of the Cambridge Philosophical Society , volume 37 , pages 194\u2013 197 . Cambridge Univ Press, 1941. Rowland Leonard Brooks. On colouring the nodes of a network. In Mathematical Proceedings of the Cambridge Philosophical Society, volume 37, pages 194\u2013197. Cambridge Univ Press, 1941."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729330"},{"volume-title":"Finding planted k-coloring in vector k-colorable graphs. MSC Thesis","author":"David Roee","key":"e_1_3_2_1_11_1","unstructured":"Roee David . Finding planted k-coloring in vector k-colorable graphs. MSC Thesis , Weizmann Institute , http:\/\/www.wisdom.weizmann.ac.il\/\u223cfeige\/ TechnicalReports\/ RoeeDavidThesis.pdf, 2013. Roee David. Finding planted k-coloring in vector k-colorable graphs. MSC Thesis, Weizmann Institute, http:\/\/www.wisdom.weizmann.ac.il\/\u223cfeige\/ TechnicalReports\/ RoeeDavidThesis.pdf, 2013."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Roee David and Uriel Feige. On the effect of randomness on planted 3-coloring models. CoRR http:\/\/arxiv.org\/abs\/1603.05183 2016.  Roee David and Uriel Feige. On the effect of randomness on planted 3-coloring models. CoRR http:\/\/arxiv.org\/abs\/1603.05183 2016.","DOI":"10.1145\/2897518.2897561"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703431391"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1773"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v27:2"},{"key":"e_1_3_2_1_16_1","first-page":"363","volume-title":"Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms","author":"Flaxman Abraham","unstructured":"Abraham Flaxman . A spectral technique for random satisfiable 3CNF formulas . In Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms , pages 357\u2013 363 . Society for Industrial and Applied Mathematics, 2003. Abraham Flaxman. A spectral technique for random satisfiable 3CNF formulas. In Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pages 357\u2013363. Society for Industrial and Applied Mathematics, 2003."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73063"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579329"},{"key":"e_1_3_2_1_19_1","volume-title":"Some simplified NP-complete graph problems. Theoretical computer science, 1(3):237\u2013267","author":"Garey Michael R","year":"1976","unstructured":"Michael R Garey , David S. Johnson , and Larry Stockmeyer . Some simplified NP-complete graph problems. Theoretical computer science, 1(3):237\u2013267 , 1976 . Michael R Garey, David S. Johnson, and Larry Stockmeyer. Some simplified NP-complete graph problems. Theoretical computer science, 1(3):237\u2013267, 1976."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-06-01126-8"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008374125234"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/274787.274791"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_1_24_1","first-page":"469","volume-title":"Coloring 3-colorable graphs with o(n 1\/5 ) colors","author":"Mikkel Thorup Kawarabayashi","year":"2014","unstructured":"Ken-ichi Kawarabayashi and Mikkel Thorup . Coloring 3-colorable graphs with o(n 1\/5 ) colors . pages 458\u2013 469 , 2014 . Ken-ichi Kawarabayashi and Mikkel Thorup. Coloring 3-colorable graphs with o(n 1\/5 ) colors. pages 458\u2013469, 2014."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.78"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(75)90089-1"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214013"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591841"},{"key":"e_1_3_2_1_29_1","first-page":"537","volume-title":"Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on","author":"McSherry Frank","unstructured":"Frank McSherry . Spectral partitioning of random graphs . In Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on , pages 529\u2013 537 . IEEE, 2001. Frank McSherry. Spectral partitioning of random graphs. In Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on, pages 529\u2013537. IEEE, 2001."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(91)90112-F"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990310"}],"event":{"name":"STOC '16: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Cambridge MA USA","acronym":"STOC '16"},"container-title":["Proceedings of the forty-eighth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897561","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897518.2897561","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:57Z","timestamp":1750222557000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897561"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,19]]},"references-count":31,"alternative-id":["10.1145\/2897518.2897561","10.1145\/2897518"],"URL":"https:\/\/doi.org\/10.1145\/2897518.2897561","relation":{},"subject":[],"published":{"date-parts":[[2016,6,19]]},"assertion":[{"value":"2016-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}