{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T21:19:46Z","timestamp":1761945586176,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540659655"},{"type":"electronic","value":"9783540488286"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/bfb0095115","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T14:31:59Z","timestamp":1164378719000},"page":"292-300","source":"Crossref","is-referenced-by-count":5,"title":["Phase transitions in the regular random 3-SAT problem"],"prefix":"10.1007","author":[{"given":"Ram\u00f3n","family":"B\u00e9jar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felip","family":"Many\u00e0","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,10,20]]},"reference":[{"key":"30_CR1","unstructured":"P. Cheeseman, B. Kanefsky, and W. M. Taylor. Where the really hard problems are. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI\u201991, pages 331\u2013337, 1991."},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5:394\u2013397, 1962.","journal-title":"Communications of the ACM"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"R. H\u00e4hnle. Uniform notation of tableaux rules for multiple-valued logics. In Proc. International Symposium on Multiple-Valued Logic, Victoria, pages 238\u2013245. IEEE Press, 1991.","DOI":"10.1109\/ISMVL.1991.130736"},{"issue":"6","key":"30_CR4","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1093\/logcom\/4.6.905","volume":"4","author":"R. H\u00e4hnle","year":"1994","unstructured":"R. H\u00e4hnle. Short conjunctive normal forms in finitely-valued logics. Journal of Logic and Computation, 4(6):905\u2013927, 1994.","journal-title":"Journal of Logic and Computation"},{"key":"30_CR5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1080\/11663081.1996.10510866","volume":"6","author":"R. H\u00e4hnle","year":"1996","unstructured":"R. H\u00e4hnle. Exploiting data dependencies in many-valued logics. Journal of Applied Non-Classical Logics, 6:49\u201369, 1996.","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"30_CR6","unstructured":"R. H\u00e4hnle. Personal communication, 1998."},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"L. M. Kirousis, E. Kranakis, and D. Krizanc. Aproximating, the unsatisfiability threshold of random formulas. In Proc. 4th Annual European Symposium on Algorithms, ESA\u201996, pages 27\u201338, 1996.","DOI":"10.1007\/3-540-61680-2_44"},{"issue":"3","key":"30_CR8","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/s005000050042","volume":"2","author":"F. Many\u00e0","year":"1998","unstructured":"F. Many\u00e0, R. B\u00e9jar, and G. Escalada-Imaz. The satisfiability problem in regular CNF-formulas. Soft Computing: A Fusion of Foundations, Methodologies and Applications, 2(3):116\u2013123, 1998.","journal-title":"Soft Computing: A Fusion of Foundations, Methodologies and Applications"},{"key":"30_CR9","unstructured":"D. Mitchell, B. Selman, and H. Levesque. Hard and easy distributions of SAT problems. In Proceedings of the 10th National Conference on Artificial Intelligence AAAI\u201992, San Jose, CA, USA, pages 459\u2013465, 1992."}],"container-title":["Lecture Notes in Computer Science","Foundations of Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0095115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T04:26:28Z","timestamp":1736655988000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0095115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540659655","9783540488286"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0095115","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}