{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:17Z","timestamp":1760202617832},"publisher-location":"Berlin, Heidelberg","reference-count":9,"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_37","type":"book-chapter","created":{"date-parts":[[2010,7,8]],"date-time":"2010-07-08T18:20:37Z","timestamp":1278613237000},"page":"388-397","source":"Crossref","is-referenced-by-count":11,"title":["Zero-One Designs Produce Small Hard SAT Instances"],"prefix":"10.1007","author":[{"given":"Allen","family":"Van Gelder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivor","family":"Spence","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","unstructured":"Anderson, I.: Combinatorial Designs: Construction Methods. Ellis Horwood (1990)"},{"volume-title":"CRC Handbook of Combinatorial Designs","year":"1996","key":"37_CR2","unstructured":"Colbourn, C.J., Dinitz, J.H. (eds.): CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton (1996)"},{"key":"37_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11499107_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2005","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: MiniSat \u2013 A SAT Solver with Conflict-Clause Minimization. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569. Springer, Heidelberg (2005)"},{"key":"37_CR4","first-page":"386","volume-title":"IJCAI","author":"M. Gebser","year":"2007","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: IJCAI, pp. 386\u2013392. AAAI, Menlo Park (2007)"},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-540-72788-0_30","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"O. Kullmann","year":"2007","unstructured":"Kullmann, O.: Polynomial time SAT decision for complementation-invariant clause-sets, and sign-non-singular matrices. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 314\u2013327. Springer, Heidelberg (2007)"},{"key":"37_CR6","unstructured":"Le Berre, D.: The SAT competitions (2009), http:\/\/www.satcompetition.org\/"},{"key":"37_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-540-95891-8_41","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"S. Porschen","year":"2009","unstructured":"Porschen, S., Schmidt, T.: On some SAT-variants over linear formulas. In: Nielsen, M., Kucera, A., Miltersen, P.B., Palamidessi, C., Tuma, P., Valencia, F.D. (eds.) SOFSEM 2009. LNCS, vol.\u00a05404, pp. 449\u2013460. Springer, Heidelberg (2009)"},{"key":"37_CR8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.3233\/SAT190043","volume":"4","author":"I. Spence","year":"2008","unstructured":"Spence, I.: tts: A SAT-solver for small, difficult instances. Journal on Satisfiability, Boolean Modeling and Computation\u00a04, 173\u2013190 (2008)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"37_CR9","first-page":"1","volume":"15","author":"I. Spence","year":"2010","unstructured":"Spence, I.: sgen1: A generator of small but difficult satisfiability benchmarks. Journal of Experimental Algorithms\u00a015, 1.1\u20131.15 (2010)","journal-title":"Journal of Experimental Algorithms"}],"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_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T15:42:06Z","timestamp":1591458126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14186-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141850","9783642141867"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14186-7_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}