{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:10:47Z","timestamp":1761621047390},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232414"},{"type":"electronic","value":"9783540302018"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30201-8_6","type":"book-chapter","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T21:14:37Z","timestamp":1285190077000},"page":"32-46","source":"Crossref","is-referenced-by-count":8,"title":["Statistical Regimes Across Constrainedness Regions"],"prefix":"10.1007","author":[{"given":"Carla P.","family":"Gomes","sequence":"first","affiliation":[]},{"given":"C\u00e8sar","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[]},{"given":"Bart","family":"Selman","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Bessiere","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(95)00044-5","volume":"81","author":"T. Hogg","year":"1996","unstructured":"Hogg, T., Huberman, B., Williams, C.: Phase Transitions and Search Problems. Artificial Intelligence\u00a081 (1-2), 1\u201315 (1996)","journal-title":"Artificial Intelligence"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0004-3702(94)90109-0","volume":"70","author":"I. Gent","year":"1994","unstructured":"Gent, I., Walsh, T.: Easy Problems are Sometimes Hard. Artificial Intelligence\u00a070, 335\u2013345 (1994)","journal-title":"Artificial Intelligence"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0004-3702(94)90088-4","volume":"69","author":"T. Hogg","year":"1994","unstructured":"Hogg, T., Williams, C.: The Hardest Constraint Problems: a Double Phase Transition. Artificial Intelligence\u00a069, 359\u2013377 (1994)","journal-title":"Artificial Intelligence"},{"key":"6_CR4","unstructured":"Smith, B., Grant, S.: Sparse Constraint Graphs and Exceptionally Hard Problems. In: Proceedings IJCAI 1995, Montr\u00e9al, Canada, pp. 646\u2013651 (1995)"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(95)00056-9","volume":"81","author":"B. Selman","year":"1996","unstructured":"Selman, B., Kirkpatrick, S.: Finite-Size Scaling of the Computational Cost of Systematic Search. Artificial Intelligence\u00a081, 273\u2013295 (1996)","journal-title":"Artificial Intelligence"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Smith, B., Grant, S.: Modelling Exceptionally Hard Constraint Satisfaction Problems. In: Proceedings CP 1997, Linz, Austria, pp. 182\u2013195 (1997)","DOI":"10.1007\/BFb0017439"},{"key":"6_CR7","unstructured":"Frost, D., Rish, I., Vila, L.: Summarizing CSP Hardness with Continuous Probability Distributions. In: AAAI 1997, Providence RI, pp. 327\u2013333 (1997)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Gomes, C., Selman, B., Crato, N.: Heavy-tailed Distributions in Combinatorial Search. In: Proceedings CP 1997, Linz, Austria, pp. 121\u2013135 (1997)","DOI":"10.1007\/BFb0017434"},{"key":"6_CR9","unstructured":"Hoos, H.: PhD Thesis,TU Darmstadt (1998)"},{"key":"6_CR10","volume-title":"Constraint Processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/3-540-45578-7_28","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"H. Chen","year":"2001","unstructured":"Chen, H., Gomes, C., Selman, B.: Formal Models of Heavy-tailed Behavior in Combinatorial Search. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 408\u2013421. Springer, Heidelberg (2001)"},{"key":"6_CR12","unstructured":"Williams, R., Gomes, C., Selman, B.: Backdoors to Typical Case Complexity (2003)"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/3-540-45349-0_32","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"T. Walsh","year":"2000","unstructured":"Walsh, T.: SAT vs CSP. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 441\u2013456. Springer, Heidelberg (2000)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BFb0017433","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"D. Achlioptas","year":"1997","unstructured":"Achlioptas, D., Kirousis, L., Kranakis, E., Krizanc, D., Molloy, M., Stamatiou, Y.: Random Constraint Satisfaction: a More Accurate Picture. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 107\u2013120. Springer, Heidelberg (1997)"},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1613\/jair.696","volume":"12","author":"K. Xu","year":"2000","unstructured":"Xu, K., Li, W.: Exact Phase Transition in Random Constraint Satisfaction Problems. JAIR\u00a012, 93\u2013103 (2000)","journal-title":"JAIR"},{"key":"6_CR16","unstructured":"Bessi\u00e8re, C., Zanuttini, B., Fern\u00e1ndez, C.: Measuring Search Trees. In: Hnich, B. (ed.) Proceedings ECAI 2004 Workshop on Modelling and Solving Problems with Constraints, Valencia, Spain (2004)"},{"key":"6_CR17","unstructured":"Li, C.: Ambulagan: Heuristics Based on Unit Propagation for Satisfiability Problems. In: Proceedings IJCAI 1997, Nagoya, Japan, pp. 366\u2013371 (1997)"}],"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_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:54:28Z","timestamp":1620014068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30201-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232414","9783540302018"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30201-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}