{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:11Z","timestamp":1720640831772},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s1571-0653(04)00460-3","type":"journal-article","created":{"date-parts":[[2004,10,24]],"date-time":"2004-10-24T03:07:12Z","timestamp":1098587232000},"page":"15-20","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story"],"prefix":"10.1016","volume":"16","author":[{"given":"Yong","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Culberson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00460-3_NEWBIB1","doi-asserted-by":"crossref","unstructured":"Mitchell D.: Resolution complexity of random constraints. In: Proceedings Principles and Practices of Constraint Programming - CP 2002, Springer (2002) 295\u2013309","DOI":"10.1007\/3-540-46135-3_20"},{"key":"10.1016\/S1571-0653(04)00460-3_NEWBIB2","doi-asserted-by":"crossref","unstructured":"Kirousis L., P. Kranakis, D. Krizanc, Y. Stamation: Approximating the unsatisfiability threshold of random formulas. Random Structures and Algorithms 12(3) (1994) 253\u2013269","DOI":"10.1002\/(SICI)1098-2418(199805)12:3<253::AID-RSA3>3.0.CO;2-U"},{"key":"10.1016\/S1571-0653(04)00460-3_NEWBIB3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0304-3975(01)00159-1","article-title":"A survey of lower bounds for random 3-sat via differential equations","volume":"265","author":"Achlioptas","year":"2001","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0653(04)00460-3_NEWBIB4","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0304-3975(01)00161-X","article-title":"Upper bounds on the satisfiability threshold","volume":"265","author":"Dubois","year":"2001","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0653(04)00460-3_NEWBIB5","doi-asserted-by":"crossref","unstructured":"Molloy M.: Models and thresholds for random constraint satisfaction problems. In: Proceedings of the 34th ACM Symposium on Theory of Computing, ACM Press (2002) 209\u2013217","DOI":"10.1145\/509907.509941"},{"key":"10.1016\/S1571-0653(04)00460-3_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Achlioptas D., L. M. Kirousis, E. Kranakis, D. Krizanc, M. Molloy, Y. C. Stamation: Random constraint satisfaction: A more accurate picture. In: Proceedings of CP97, Springer (1997) 107\u2013120","DOI":"10.1007\/BFb0017433"},{"key":"10.1016\/S1571-0653(04)00460-3_NEWBIB7","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1023\/A:1011454308633","article-title":"Random constraint satisfaction: Flaws and structure","volume":"6","author":"Gent","year":"2001","journal-title":"CONSTRAINTS"},{"key":"10.1016\/S1571-0653(04)00460-3_NEWBIB8","unstructured":"Xu K., Li W.: Many hard examples in exact phase transitions with applications to generating hard satisfiable instances. personal communication (2003)"},{"key":"10.1016\/S1571-0653(04)00460-3_NEWBIB9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0166-218X(01)00358-4","article-title":"A perspective on certain polynomial-time solvable classes of satisfiability","volume":"125","author":"Franco","year":"2003","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S1571-0653(04)00460-3_NEWBIB10","unstructured":"Friedman J., Goerdt A.: Recognizing more unsatisfiable random k-sat instances efficiently. In: Lecture Notes in Computer Science 2076, Springer (2001) 310\u2013321"},{"key":"10.1016\/S1571-0653(04)00460-3_NEWBIB11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0377-0427(01)00464-2","article-title":"The phase transition in a random hypergraph","volume":"142","author":"Karonski","year":"2002","journal-title":"J. Comput. Appl. Math"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004603?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004603?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T21:57:10Z","timestamp":1549144630000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304004603"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":11,"alternative-id":["S1571065304004603"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00460-3","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}