{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:45:38Z","timestamp":1725479138332},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262763"},{"type":"electronic","value":"9783540316794"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11499107_9","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T17:56:25Z","timestamp":1279130185000},"page":"122-134","source":"Crossref","is-referenced-by-count":0,"title":["Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming"],"prefix":"10.1007","author":[{"given":"Marijn","family":"Heule","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"van Maaren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(01)00159-1","volume":"265","author":"D. Achlioptas","year":"2001","unstructured":"Achlioptas, D.: Lower Bounds for Random 3-SAT via Differential Equations. Theoretical Computer Science\u00a0265(1-2), 159\u2013185 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1137\/S0097539792228629","volume":"23","author":"E. Boros","year":"1994","unstructured":"Boros, E., Crama, Y., Hammer, P., Saks, M.: A complexity Index for Satisfiability Problems. SIAM Journal on Computing\u00a023(1), 45\u201349 (1994)","journal-title":"SIAM Journal on Computing"},{"issue":"1-2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0304-3975(01)00158-X","volume":"265","author":"J. Franco","year":"2001","unstructured":"Franco, J.: Results related to threshold phenomena research in Satisfiability: lower bounds. Theoretical Computer Science\u00a0265(1-2), 147\u2013157 (2001)","journal-title":"Theoretical Computer Science"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/3-540-45749-6_51","volume-title":"Algorithms - ESA 2002","author":"A.C. Kaporis","year":"2002","unstructured":"Kaporis, A.C., Kirousis, L.M., Lalas, E.G.: The Probabilistic Analysis of a Greedy Satisfiability Algorithm. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 574\u2013585. Springer, Heidelberg (2002)"},{"doi-asserted-by":"crossref","unstructured":"Kaporis, A.C., Kirousis, L.M., Lalas, E.G.: Selecting complementary pairs of literals. Electronic Notes in Discrete Mathematics\u00a016 (2003)","key":"9_CR5","DOI":"10.1016\/S1571-0653(04)00462-7"},{"issue":"1-3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0166-218X(00)00262-6","volume":"107","author":"O. Kullmann","year":"2000","unstructured":"Kullmann, O.: Investigations on autark assignments. Discrete Applied Mathematics\u00a0107(1-3), 99\u2013137 (2000)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0166-218X(02)00406-7","volume":"130","author":"O. Kullmann","year":"2003","unstructured":"Kullmann, O.: Lean clause-sets: generalizations of minimally unsatisfiable clause-sets. Discrete Applied Mathematics\u00a0130(2), 209\u2013249 (2003)","journal-title":"Discrete Applied Mathematics"},{"unstructured":"Van Gelder, A.: Problem generator mkcnf.c contributed to the DIMACS Challenge archieve","key":"9_CR8"},{"issue":"3-5","key":"9_CR9","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0167-6377(98)00052-2","volume":"23","author":"J.P. Warners","year":"1998","unstructured":"Warners, J.P., van Maaren, H.: A two phase algorithm for solving a class of hard satisfiability problems. Oper. Res. Lett.\u00a023(3-5), 81\u201388 (1998)","journal-title":"Oper. Res. Lett."},{"issue":"1-3","key":"9_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0166-218X(00)00249-3","volume":"107","author":"J. Warners","year":"2000","unstructured":"Warners, J., van Maaren, H.: Solving satisfiability problems using elliptic approximations. Effective branching rules. Discrete Applied Mathematics\u00a0107(1-3), 241\u2013259 (2000)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11499107_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,16]],"date-time":"2019-03-16T14:23:39Z","timestamp":1552746219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11499107_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262763","9783540316794"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11499107_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}