{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T09:27:00Z","timestamp":1791278820753,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540232414","type":"print"},{"value":"9783540302018","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30201-8_33","type":"book-chapter","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T21:14:37Z","timestamp":1285190077000},"page":"438-452","source":"Crossref","is-referenced-by-count":83,"title":["Understanding Random SAT: Beyond the Clauses-to-Variables Ratio"],"prefix":"10.1007","author":[{"given":"Eugene","family":"Nudelman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kevin","family":"Leyton-Brown","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Holger H.","family":"Hoos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alex","family":"Devkar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yoav","family":"Shoham","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"33_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-540-24605-3_26","volume-title":"Theory and Applications of Satisfiability Testing","author":"F. Bacchus","year":"2004","unstructured":"Bacchus, F., Winter, J.: Effective preprocessing with hyper-resolution and equality reduction. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 341\u2013355. Springer, Heidelberg (2004)"},{"key":"33_CR2","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the Really Hard Problems Are. In: Proc. IJCAI 1991, pp. 331\u2013337 (1991)"},{"issue":"1","key":"33_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1023\/A:1006314320276","volume":"24","author":"C. Gomes","year":"2000","unstructured":"Gomes, C., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. of Automated Reasoning\u00a024(1), 67\u2013100 (2000)","journal-title":"J. of Automated Reasoning"},{"key":"33_CR4","volume-title":"Stochastic Local Search \u2013 Foundations and Applications","author":"H.H. Hoos","year":"2004","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search \u2013 Foundations and Applications. Morgan Kaufmann, San Francisco (2004) (to appear)"},{"key":"33_CR5","first-page":"296","volume-title":"Proc. IJCAI 1999","author":"H.H. Hoos","year":"1999","unstructured":"Hoos, H.H.: SAT-encodings, search space structure, and local search performance. In: Proc. IJCAI 1999, pp. 296\u2013302. Morgan Kaufmann, San Francisco (1999)"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0004-3702(99)00048-X","volume":"112","author":"H.H. Hoos","year":"1999","unstructured":"Hoos, H.H., St\u00fctzle, T.: Towards a characterisation of the behaviour of stochastic local search algorithms for sat. Artificial Intelligence\u00a0112, 213\u2013232 (1999)","journal-title":"Artificial Intelligence"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Horvitz, E., Ruan, Y., Gomes, C., Kautz, H., Selman, B., Chickering, M.: A Bayesian approach to tackling hard computational problems. In: Proc. UAI 2001, pp. 235\u2013244 (2001)","DOI":"10.1016\/S1571-0653(04)00335-X"},{"key":"33_CR8","unstructured":"Kolaitis, P.: Constraint satisfaction, databases and logic. In: Proc. IJCAI 2003, pp. 1587\u20131595 (2003)"},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1007\/978-3-540-45193-8_75","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"K. Leyton-Brown","year":"2003","unstructured":"Leyton-Brown, K., Nudelman, E., Andrew, G., McFadden, J., Shoham, Y.: Boosting as a metaphor for algorithm design. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 899\u2013903. Springer, Heidelberg (2003)"},{"key":"33_CR10","unstructured":"Leyton-Brown, K., Nudelman, E., Andrew, G., McFadden, J., Shoham, Y.: A portfolio approach to algorithm selection. In: Proc. IJCAI 2003, pp. 1542\u20131542 (2003)"},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/3-540-46135-3_37","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"K. Leyton-Brown","year":"2002","unstructured":"Leyton-Brown, K., Nudelman, E., Shoham, Y.: Learning the empirical hardness of optimization problems: The case of combinatorial auctions. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 556\u2013572. Springer, Heidelberg (2002)"},{"key":"33_CR12","unstructured":"Lobjois, L., Lema\u00eetre, M.: Branch and bound algorithm selection by performance prediction. In: Proc. AAAI 1998, pp. 353\u2013358 (1998)"},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1038\/22055","volume":"400","author":"R. Monasson","year":"1999","unstructured":"Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Troyansky, L.: Determining computational complexity from characteristic \u2018phase transitions\u2019. Nature\u00a0400, 133\u2013137 (1999)","journal-title":"Nature"},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/3-540-46135-3_38","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"Y. Ruan","year":"2002","unstructured":"Ruan, Y., Horvitz, E., Kautz, H.: Restart policies with dependence among runs: A dynamic programming approach. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 573\u2013586. Springer, Heidelberg (2002)"},{"issue":"1-2","key":"33_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0004-3702(95)00045-3","volume":"81","author":"B. Selman","year":"1996","unstructured":"Selman, B., Mitchell, D.G., Levesque, H.J.: Generating hard satisfiability problems. Artificial Intelligence\u00a081(1-2), 17\u201329 (1996)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"33_CR16","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R. Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. Royal Statist. Soc B\u00a058(1), 267\u2013288 (1996)","journal-title":"J. Royal Statist. Soc B"},{"key":"33_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/11527695_24","volume-title":"Theory and Applications of Satisfiability Testing","author":"D. Tompkins","year":"2005","unstructured":"Tompkins, D., Hoos, H.: UBCSAT: An implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 37\u201346. Springer, Heidelberg (2005)"},{"key":"33_CR18","unstructured":"Williams, R., Gomes, C., Selman, B.: Backdoors to typical case complexity. In: Proc. IJCAI 2003, pp. 1173\u20131178 (2003)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30201-8_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T00:23:18Z","timestamp":1740529398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30201-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232414","9783540302018"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30201-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}