{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T21:13:22Z","timestamp":1774646002655,"version":"3.50.1"},"reference-count":25,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2002.1182002","type":"proceedings-article","created":{"date-parts":[[2003,6,26]],"date-time":"2003-06-26T11:35:00Z","timestamp":1056627300000},"page":"769-778","source":"Crossref","is-referenced-by-count":51,"title":["The 3-XORSAT threshold"],"prefix":"10.1109","author":[{"given":"O.","family":"Dubois","sequence":"first","affiliation":[]},{"given":"J.","family":"Mandler","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199805)12:3<253::AID-RSA3>3.0.CO;2-U"},{"key":"17","article-title":"Analytical depoissonization and its applications","volume":"199","author":"jacquet","year":"1997","journal-title":"Theoretical Computer Science"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200009)17:2<103::AID-RSA2>3.0.CO;2-P"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-005-0017-3"},{"key":"16","first-page":"279","article-title":"Stirling distributions and stirling numbers of the second kind. Computational problems in statistics","volume":"279","author":"hennecart","year":"1994","journal-title":"Kybernetika"},{"key":"13","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1090\/S0894-0347-99-00305-7","article-title":"Sharp thresholds of graph properties, and the k-SAT problem. With an appendix by Jean Bourgain","volume":"12","author":"friedgut","year":"1999","journal-title":"Journal of the American Mathematical Society"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0016"},{"key":"11","author":"durrett","year":"1991","journal-title":"Probability Theory and Examples"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.87.127209"},{"key":"21","article-title":"Tight thresholds for the pure literal rule","author":"mitzenmacher","year":"1997"},{"key":"20","first-page":"207","article-title":"Me?moire sur les approximations des formules qui sont fonctions de tre?s-grands nombres","volume":"10","author":"laplace","year":"1893","journal-title":"?uvres Comple?tes"},{"key":"22","doi-asserted-by":"crossref","first-page":"1357","DOI":"10.1103\/PhysRevE.56.1357","article-title":"Statistical mechanics of the random k-Sat problem","volume":"56","author":"monasson","year":"1997","journal-title":"Phy Rev E"},{"key":"23","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/sapm1993893233","article-title":"Asymptotic estimates of stirling numbers","volume":"89","author":"temme","year":"1993","journal-title":"Stud Appl Math"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.63.026702"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177004612"},{"key":"3","first-page":"322","article-title":"On the satisfiability and maximum satisfiability of random 3-CNF formulas","author":"broder","year":"0","journal-title":"Proc 4th ACM-SIAM Symp on Discrete Algorithms Austin TX 1993"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1974-0330867-1"},{"key":"10","article-title":"Phase transition in combinatorial poblems","volume":"265","author":"dubois","year":"2001","journal-title":"Theoretical Computer Science"},{"key":"1","author":"alon","year":"1992","journal-title":"The Probabilistic Method"},{"key":"7","author":"de bruijn","year":"1981","journal-title":"Asymptotic Methods in Analysis"},{"key":"6","article-title":"Approximating the satisfiability threshold for random k-XOR-formulas","author":"creignou","year":"2001"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00032-3"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1524\/anly.2000.20.1.1"},{"key":"9","first-page":"124","article-title":"Typical random 3-SAT formulae and the satisfibility threshold","author":"dubois","year":"0","journal-title":"Proc 11th ACM-SIAM Symp on Discrete Algorithms San Francisco CA January 2000"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0867"}],"event":{"name":"43rd Annual IEEE Symposium on Foundations of Computer Science","location":"Vancouver, BC, Canada","acronym":"SFCS-02"},"container-title":["The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings."],"original-title":[],"link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx5\/8411\/26517\/01182002.pdf?arnumber=1182002","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T18:46:26Z","timestamp":1497552386000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/ieeexplore.ieee.org\/document\/1182002\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":25,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/sfcs.2002.1182002","relation":{},"subject":[]}}