{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T19:42:47Z","timestamp":1648669367304},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0020-0190(03)00259-x","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T13:32:55Z","timestamp":1053351175000},"page":"111-117","source":"Crossref","is-referenced-by-count":0,"title":["Inclusion\u2013exclusion for k-CNF formulas"],"prefix":"10.1016","volume":"87","author":[{"given":"Kazuyuki","family":"Amano","sequence":"first","affiliation":[]},{"given":"Kazuo","family":"Iwama","sequence":"additional","affiliation":[]},{"given":"Akira","family":"Maruoka","sequence":"additional","affiliation":[]},{"given":"Kenshi","family":"Matsuo","sequence":"additional","affiliation":[]},{"given":"Akihiro","family":"Matsuura","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0020-0190(03)00259-X_BIB001","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1137\/0218026","article-title":"CNF satisfiability test by counting and polynomial average time","volume":"18","author":"Iwama","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(03)00259-X_BIB002","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/BF01271266","article-title":"Inclusion\u2013exclusion: exact and approximate","volume":"16","author":"Kahn","year":"1996","journal-title":"Combinatorica"},{"key":"10.1016\/S0020-0190(03)00259-X_BIB003","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02128670","article-title":"Approximate inclusion\u2013exclusion","volume":"10","author":"Linial","year":"1990","journal-title":"Combinatorica"},{"key":"10.1016\/S0020-0190(03)00259-X_BIB004","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0020-0190(92)90160-W","article-title":"Computing propositional models","volume":"41","author":"Lozinskii","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(03)00259-X_BIB005","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0166-218X(96)00048-0","article-title":"A note on approximate inclusion\u2013exclusion","volume":"73","author":"Melkman","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(03)00259-X_BIB006","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900300259X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900300259X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T06:51:26Z","timestamp":1553151086000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001900300259X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S002001900300259X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(03)00259-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}