{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:36Z","timestamp":1725663156653},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540502418"},{"type":"electronic","value":"9783540459606"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-50241-6_44","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:18:41Z","timestamp":1330201121000},"page":"281-288","source":"Crossref","is-referenced-by-count":2,"title":["On the average case complexity of backtracking for the exact-satisfiability problem"],"prefix":"10.1007","author":[{"given":"Ewald","family":"Speckenmeyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"20_CR1","volume-title":"Set partitioning \u2014 A survey","author":"E. Balas","year":"1979","unstructured":"E. Balas and M.W. Padberg, Set partitioning \u2014 A survey, in: N. Christofides, et al., eds., Combinatorial Optimization, Wiley, Chichester, 1979"},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0196-6774(85)90044-6","volume":"6","author":"E.A. Bender","year":"1985","unstructured":"E.A. Bender and H.S. Wilf, A theoretical analysis of backtracking in the graph coloring problem, J. Algorithms, 6, (1985) 275\u2013282","journal-title":"J. Algorithms"},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0020-0190(86)90051-7","volume":"23","author":"J. Franco","year":"1986","unstructured":"J. Franco, On the probabilistic performance of algorithms for the satisfiability problem, Inform. Process. Lett., 23, (1986) 103\u2013106","journal-title":"Inform. Process. Lett."},{"key":"20_CR4","volume-title":"Computers and Intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, Freeman, San Francisco\/CA, 1979"},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/0020-0190(82)90110-7","volume":"15","author":"A. Goldberg","year":"1982","unstructured":"A. Goldberg, P. Purdom, and C. Brown, Average time analyses of simplified Davis-Putnam procedures, Inform. Process. Lett., 15, (1982) 72\u201375","journal-title":"Inform. Process. Lett."},{"key":"20_CR6","first-page":"419","volume":"43","author":"B. Monien","year":"1982","unstructured":"B. Monien, E. Speckenmeyer, and O. Vornberger, Upper bounds for covering problems, Methods of Operations Research, 43, (1982) 419\u2013431","journal-title":"Methods of Operations Research"},{"unstructured":"E. Speckenmeyer, Classes of CNF-formulas with backtracking trees of exponential or linear average order for exact-satisfiability, Bericht Nr. 47, Reihe Theoretische Informatik, Paderborn 1987","key":"20_CR7"}],"container-title":["Lecture Notes in Computer Science","CSL '87"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50241-6_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:54:36Z","timestamp":1619571276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50241-6_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540502418","9783540459606"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-50241-6_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}