{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:18:00Z","timestamp":1729635480148,"version":"3.28.0"},"reference-count":32,"publisher":"IEEE Computer. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2003.1238207","type":"proceedings-article","created":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T21:26:50Z","timestamp":1078176410000},"page":"330-339","source":"Crossref","is-referenced-by-count":5,"title":["The resolution complexity of random constraint satisfaction problems"],"prefix":"10.1109","author":[{"given":"M.","family":"Molloy","sequence":"first","affiliation":[]},{"given":"M.","family":"Salavatipour","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0653(04)00460-3"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00317-1"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00156-6"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548302005552"},{"key":"16","article-title":"The 3-XORSAT threshold (strong evidence in favour of the replica method of statistical physics)","author":"dubois","year":"0","journal-title":"Proceedings of FOCS 2002"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00032-3"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-7915-6_49"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267789"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/48014.48016"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0081"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011454308633"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90144-6"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199805)12:3<253::AID-RSA3>3.0.CO;2-U"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46135-3_20"},{"article-title":"The resolution complexity of constraint satisfaction","year":"2002","author":"mitchell","key":"26"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700368667"},{"key":"28","doi-asserted-by":"crossref","first-page":"9209","DOI":"10.1088\/0305-4470\/31\/46\/011","article-title":"Tricritical point in the random 2+p-SAT problem","volume":"31","author":"monasson","year":"1998","journal-title":"J Phys A"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<414::AID-RSA10>3.0.CO;2-G"},{"key":"3","first-page":"721","article-title":"The phase transition in NAESAT and 1-in-k SAT","author":"achlioptas","year":"0","journal-title":"Proceedings of SODA 01"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380820"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375835"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00159-1"},{"key":"30","article-title":"Phase transition and search cost in the 2+p-sat problem","author":"monasson","year":"1996","journal-title":"Proceedings of PhysComp 96"},{"article-title":"The resolution complexity of random graph k-colourability","year":"0","author":"beame","key":"7"},{"journal-title":"Conference Version in Proceedings of CP 97","first-page":"107","year":"0","key":"6"},{"key":"32","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1613\/jair.696","article-title":"Exact phase transitions in random constraint satisfaction problems","volume":"12","author":"xu","year":"2000","journal-title":"J Artificial Intelligence Research"},{"key":"5","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1023\/A:1011402324562","article-title":"Random constraint satisfaction: A more accurate picture","volume":"6","author":"achlioptas","year":"2001","journal-title":"Constraints"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1145\/7531.8928"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00154-2"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369156"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1996.548486"}],"event":{"name":"44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003","acronym":"SFCS-03","location":"Cambridge, MA, USA"},"container-title":["44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8767\/27770\/01238207.pdf?arnumber=1238207","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T04:55:39Z","timestamp":1585630539000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1238207\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2003.1238207","relation":{},"subject":[]}}