{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T07:53:35Z","timestamp":1648799615647},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1007\/bf01531028","type":"journal-article","created":{"date-parts":[[2005,4,19]],"date-time":"2005-04-19T00:21:39Z","timestamp":1113870099000},"page":"185-200","source":"Crossref","is-referenced-by-count":3,"title":["Exact satisfiability, a natural extension of set partition, and its average case behavior"],"prefix":"10.1007","volume":"6","author":[{"given":"John W.","family":"Rosenthal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ewald","family":"Speckenmeyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rainer","family":"Kemp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Combinatorial Optimization","author":"E. Balas","year":"1979","unstructured":"E. Balas and M. Padberg, Set partitioning ? a survey, in:Combinatorial Optimization, eds. Christophides et al. (Wiley, Chichester, 1979)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1137\/1016082","volume":"16","author":"E.A. Bender","year":"1974","unstructured":"E.A. Bender, Asymptotic methods in enumeration, SIAM Rev. 16 (1974) 485?515.","journal-title":"SIAM Rev."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1137\/0210043","volume":"10","author":"C.A. Brown","year":"1981","unstructured":"C.A. Brown and P.W. Purdom, An average time analysis of backtracking, SIAM J. Comput. 10 (1981) 583?593.","journal-title":"SIAM J. Comput."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1137\/0215080","volume":"15","author":"M.T. Chao","year":"1986","unstructured":"M.T. Chao and J. Franco, Probabilistic analysis of two heuristics for 3-satisfiability, SIAM J. Comput. 15 (1986) 1106?1118.","journal-title":"SIAM J. Comput."},{"key":"CR5","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. Proc. Lett. 23 (1986) 103?106.","journal-title":"Inform. Proc. Lett."},{"key":"CR6","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, 1979)."},{"key":"CR7","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. Proc. Lett. 15 (1982) 72?75.","journal-title":"Inform. Proc. Lett."},{"key":"CR8","unstructured":"R. Kemp, private communication."},{"key":"CR9","first-page":"369","volume-title":"Lecture Notes Comput. Sci. 440","author":"R. Kemp","year":"1990","unstructured":"R. Kemp and E. Speckenmeyer, On the average time complexity of set partition,Proc. CSL '89, Lecture Notes Comput. Sci. 440 (Springer, Berlin, 1990) pp. 369?389."},{"key":"CR10","first-page":"419","volume":"43","author":"B. Monien","year":"1982","unstructured":"B. Monien, E. Speckenmeyer and O. Vornberger, Upper bounds for covering problems, Meth. Oper. Res. 43 (1982) 419?431.","journal-title":"Meth. Oper. Res."},{"key":"CR11","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. Comput. 12 (1983) 717?733.","journal-title":"SIAM J. Comput."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1137\/0214067","volume":"14","author":"P.W. Purdom","year":"1985","unstructured":"P.W. Purdom and C.A. Brown, The pure literal rule and polynomial average time, SIAM J. Comput. 14 (1985) 943?953.","journal-title":"SIAM J. Comput."},{"key":"CR13","first-page":"281","volume-title":"Lecture Notes Comput. Sci. 329","author":"E. Speckenmeyer","year":"1988","unstructured":"E. Speckenmeyer, On the average case complexity of backtracking for the exact-satisfiability problem,Proc. CSL'87, Lecture Notes Comput. Sci. 329 (Springer, Berlin, 1988) pp. 281?288."},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"E. Speckenmeyer, On the average case behavior of backtracking for satisfiability and exact-satisfiability, Tech. Rep. 50, Dept. Math.-Comput. Sci., Universit\ufffdt-GH Paderhorn (Habilitationsschrift) (1988).","DOI":"10.1007\/3-540-50241-6_44"},{"key":"CR15","first-page":"529","volume-title":"Lecture Notes Comput. Sci. 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 (Springer, Berlin, 1988) pp. 529?537."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01531028\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01531028.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01531028\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01531028","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T00:00:36Z","timestamp":1586217636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01531028"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["BF01531028"],"URL":"https:\/\/doi.org\/10.1007\/bf01531028","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}