{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:21Z","timestamp":1725663261396},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540527534"},{"type":"electronic","value":"9783540471370"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52753-2_51","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:42:16Z","timestamp":1330206136000},"page":"369-381","source":"Crossref","is-referenced-by-count":1,"title":["On the average time complexity of set partitioning"],"prefix":"10.1007","author":[{"given":"Ewald","family":"Speckenmeyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rainer","family":"Kemp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"23_CR1","volume-title":"Combinatorial Optimization","author":"E. Balas","year":"1979","unstructured":"E. Balas and M. Padberg. Set Partitioning \u2014 A Survey. in: Combinatorial Optimization, Christofides et al., eds., Wiley, Chichester, 1979"},{"key":"23_CR2","volume-title":"Computers and Intractability \u2014 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 \u2014 A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979"},{"key":"23_CR3","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 analysis of simplified Davis-Putnam procedures. Inform. Process. Letters, 15, 72\u201375, 1982","journal-title":"Inform. Process. Letters"},{"key":"23_CR4","unstructured":"R. Kemp. Manuscript. 1989"},{"key":"23_CR5","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, 419\u2013431, 1982","journal-title":"Methods of Operations research"},{"key":"23_CR6","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1137\/0212049","volume":"12","author":"P.W. Purdom","year":"1983","unstructured":"P.W. Purdom and C.A. Brown. An analysis of backtracking with search rearrangement. SIAM J. Computing, 12, 717\u2013733, 1983","journal-title":"SIAM J. Computing"},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/BFb0017176","volume":"324","author":"E. Speckenmeyer","year":"1988","unstructured":"E. Speckenmeyer. Classes of CNF-formulas with backtracking trees of exponential or linear average order for exact-satisfiability. Proc. MFCS '88, Lecture Notes Comput. Sci. 324, 529\u2013537, Springer-Verlag, Berlin, 1988","journal-title":"Lecture Notes Comput. Sci."},{"key":"23_CR8","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1080\/00029890.1985.11971591","volume":"92","author":"H.S. Wilf","year":"1985","unstructured":"H.S. Wilf. Some examples of combinatorial averaging. The American Math. Monthly, 92, 250\u2013261, 1985","journal-title":"The American Math. Monthly"}],"container-title":["Lecture Notes in Computer Science","CSL '89"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52753-2_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:09:20Z","timestamp":1619572160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52753-2_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540527534","9783540471370"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-52753-2_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}