{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:47Z","timestamp":1725558947498},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141850"},{"type":"electronic","value":"9783642141867"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14186-7_10","type":"book-chapter","created":{"date-parts":[[2010,7,8]],"date-time":"2010-07-08T18:20:37Z","timestamp":1278613237000},"page":"99-112","source":"Crossref","is-referenced-by-count":1,"title":["Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold"],"prefix":"10.1007","author":[{"given":"Yacine","family":"Boufkhad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Hugel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","first-page":"459","volume-title":"Proceedings of the National Conference on Artificial Intelligence","author":"D. Mitchell","year":"1992","unstructured":"Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of SAT problems. In: Proceedings of the National Conference on Artificial Intelligence, pp. 459\u2013459. AAAI, Menlo Park (1992)"},{"issue":"1-3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10817-005-9012-z","volume":"35","author":"Y. Boufkhad","year":"2005","unstructured":"Boufkhad, Y., Dubois, O., Interian, Y., Selman, B.: Regular Random k-{SAT}: Properties of Balanced Formulas. J. Autom. Reasoning\u00a035(1-3), 181\u2013200 (2005)","journal-title":"J. Autom. Reasoning"},{"issue":"4","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1090\/S0894-0347-99-00305-7","volume":"12","author":"E. Friedgut","year":"1999","unstructured":"Friedgut, E., Bourgain, J.: Sharp thresholds of graph properties, and the k-sat problem. Journal of the American Mathematical Society\u00a012(4), 1017\u20131054 (1999)","journal-title":"Journal of the American Mathematical Society"},{"key":"10_CR4","first-page":"947","volume":"17","author":"D. Achlioptas","year":"2004","unstructured":"Achlioptas, D., Peres, Y.: The Threshold for Random k-SAT is 2^k ln2 - O(k). JAMS: Journal of the American Mathematical Society\u00a017, 947\u2013973 (2004)","journal-title":"JAMS: Journal of the American Mathematical Society"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0166-218X(83)90017-3","volume":"5","author":"J. Franco","year":"1983","unstructured":"Franco, J., Paull, M.: Probabilistic analysis of the davis putnam procedure for solving the satisfiability problem. Discrete Appl.\u00a0Math.\u00a05, 77\u201387 (1983)","journal-title":"Discrete Appl.\u00a0Math."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1017\/S0963548300001590","volume":"4","author":"A.E. Maftouhi","year":"1995","unstructured":"Maftouhi, A.E., de la Vega, W.F.: On random 3-sat. Combinatorics, Probability & Computing\u00a04, 189\u2013195 (1995)","journal-title":"Combinatorics, Probability & Computing"},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/rsa.3240070105","volume":"7","author":"A. Kamath","year":"1995","unstructured":"Kamath, A., Motwani, R., Palem, K., Spirakis, P.: Tail bounds for occupancy and the satisfiability threshold conjecture. Random Structures and Algorithms\u00a07(1), 59\u201380 (1995)","journal-title":"Random Structures and Algorithms"},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1006\/jagm.1997.0867","volume":"24","author":"O. Dubois","year":"1997","unstructured":"Dubois, O., Boufkhad, Y.: A General Upper Bound for the Satisfiability Threshold of Random r-{SAT} Formulae. J. Algorithms\u00a024(2), 395\u2013420 (1997)","journal-title":"J. Algorithms"},{"issue":"3","key":"10_CR9","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/(SICI)1098-2418(199805)12:3<253::AID-RSA3>3.0.CO;2-U","volume":"12","author":"L.M. Kirousis","year":"1998","unstructured":"Kirousis, L.M., Kranakis, E., Krizanc, D., Stamatiou, Y.C.: Approximating the unsatisfiability threshold of random formulas. Random Structures and Algorithms\u00a012(3), 253\u2013269 (1998)","journal-title":"Random Structures and Algorithms"},{"key":"10_CR10","unstructured":"Dubois, O., Boufkhad, Y., Mandler, J.: Typical random 3-SAT formulae and the satisfiability threshold. In: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, pp. 126\u2013127. Society for Industrial and Applied Mathematics (2000)"},{"issue":"30-32","key":"10_CR11","doi-asserted-by":"publisher","first-page":"2920","DOI":"10.1016\/j.tcs.2009.02.020","volume":"410","author":"J. D\u00edaz","year":"2009","unstructured":"D\u00edaz, J., Kirousis, L., Mitsche, D., P\u00e9rez-Gim\u00e9nez, X.: On the satisfiability threshold of formulas with three literals per clause. Theoretical Computer Science\u00a0410(30-32), 2920\u20132934 (2009)","journal-title":"Theoretical Computer Science"},{"key":"10_CR12","unstructured":"Dubois, O., Boufkhad, Y., Mandler, J.: Typical random 3-SAT formulae and the satisfiability threshold. Technical report, ECCC (2003)"},{"issue":"10","key":"10_CR13","doi-asserted-by":"publisher","first-page":"3083","DOI":"10.1016\/j.disc.2008.08.020","volume":"309","author":"F. Ardila","year":"2009","unstructured":"Ardila, F., Maneva, E.N.: Pruning processes and a new characterization of convex geometries. Discrete Mathematics\u00a0309(10), 3083\u20133091 (2009)","journal-title":"Discrete Mathematics"},{"issue":"6","key":"10_CR14","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/s00013-008-2856-9","volume":"91","author":"N. Batir","year":"2008","unstructured":"Batir, N.: Inequalities for the gamma function. Archiv der Mathematik\u00a091(6), 554\u2013563 (2008)","journal-title":"Archiv der Mathematik"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Hugel, T., Boufkhad, Y.: Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold. Technical report, CoRR abs\/1002.1636 (2010)","DOI":"10.1007\/978-3-642-14186-7_10"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14186-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:31:27Z","timestamp":1559241087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14186-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141850","9783642141867"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14186-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}