{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T12:32:51Z","timestamp":1648643571832},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3552,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s0012-365x(03)00239-5","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T14:49:36Z","timestamp":1063378176000},"page":"211-220","source":"Crossref","is-referenced-by-count":0,"title":["Average running time analysis of an algorithm to calculate the size of the union of Cartesian products"],"prefix":"10.1016","volume":"273","author":[{"given":"Susumu","family":"Suzuki","sequence":"first","affiliation":[]},{"given":"Toshihide","family":"Ibaraki","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00239-5_BIB1","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1137\/0210043","article-title":"An average time analysis of backtracking","volume":"10","author":"Brown","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0012-365X(03)00239-5_BIB2","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1137\/0218026","article-title":"CNF satisfiability test by counting and polynomial time","volume":"18","author":"Iwama","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0012-365X(03)00239-5_BIB3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0004-3702(83)80007-1","article-title":"Search rearrangement backtracking and polynomial average time","volume":"21","author":"Purdom","year":"1983","journal-title":"Artif. Intell."},{"key":"10.1016\/S0012-365X(03)00239-5_BIB4","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1137\/0212049","article-title":"An analysis of backtracking with search rearrangement","volume":"12","author":"Purdom","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0012-365X(03)00239-5_BIB5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0020-0255(87)90003-X","article-title":"Polynomial-average-time satisfiability problems","volume":"41","author":"Purdom","year":"1987","journal-title":"Inform. Sci."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002395?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002395?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T13:21:20Z","timestamp":1551014480000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03002395"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0012365X03002395"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00239-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}