{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T11:59:50Z","timestamp":1778673590042,"version":"3.51.4"},"reference-count":28,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,7,1]],"date-time":"1989-07-01T00:00:00Z","timestamp":615254400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,7,1]],"date-time":"1989-07-01T00:00:00Z","timestamp":615254400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2005,11,29]],"date-time":"2005-11-29T00:00:00Z","timestamp":1133222400000},"content-version":"vor","delay-in-days":5995,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1989,7]]},"DOI":"10.1016\/0890-5401(89)90063-1","type":"journal-article","created":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T19:24:20Z","timestamp":1101929060000},"page":"34-44","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":39,"title":["Enumerative counting is hard"],"prefix":"10.1016","volume":"82","author":[{"given":"Jin-Yi","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lane A.","family":"Hemachandra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(89)90063-1_BIB1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0890-5401(88)90044-2","article-title":"Polynomial terse sets","volume":"77","author":"Amir","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/0890-5401(89)90063-1_BIB2","series-title":"Proceedings, 1st Structure in Complexity Theory Conference","first-page":"1","article-title":"The complexity of sparse sets in P","volume":"Vol. 223","author":"Allender","year":"1986"},{"key":"10.1016\/0890-5401(89)90063-1_BIB3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0304-3975(80)90027-4","article-title":"On counting problems and the polynomial-time hierarchy","volume":"12","author":"Angluin","year":"1980","journal-title":"Theoret. Comput. Sci."},{"issue":"No. 1","key":"10.1016\/0890-5401(89)90063-1_BIB4","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0020-0190(87)90036-6","article-title":"A random oracle separates PSPACE from the polynomial hierarchy","volume":"26","author":"Babai","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(89)90063-1_BIB5","author":"Beigel","year":"1987"},{"key":"10.1016\/0890-5401(89)90063-1_BIB6","series-title":"18th ACM Symposium on Theory of Computing","first-page":"21","article-title":"With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy","author":"Cai","year":"1986"},{"key":"10.1016\/0890-5401(89)90063-1_BIB7","author":"Cai","year":"1987"},{"key":"10.1016\/0890-5401(89)90063-1_BIB8","series-title":"3rd ACM Symposium on Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0890-5401(89)90063-1_BIB9","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01744431","article-title":"Parity, circuits, and the polynomial-time hierarchy","volume":"17","author":"Furst","year":"1984","journal-title":"Math. Systems Theory"},{"issue":"No. 4","key":"10.1016\/0890-5401(89)90063-1_BIB10","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic Turing machines","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(89)90063-1_BIB11","author":"Garey","year":"1979"},{"key":"10.1016\/0890-5401(89)90063-1_BIB12","series-title":"Proceedings, 2nd Structure in Complexity Theory Conference","first-page":"50","article-title":"Self-reducible, P-selective, near-testable, and P-cheatable sets: The effect of internal structure on the complexity of a set","author":"Goldsmith","year":"1987"},{"key":"10.1016\/0890-5401(89)90063-1_BIB13","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/0217018","article-title":"Complexity measures for public-key cryptosystems","volume":"17","author":"Grollmann","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(89)90063-1_BIB14","series-title":"18th ACM Symposium on Theory of Computing","first-page":"6","article-title":"Almost optimal lower bounds for small depths circuits","author":"Hastad","year":"1986"},{"key":"10.1016\/0890-5401(89)90063-1_BIB15","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0890-5401(89)90063-1_BIB16","author":"Kadin","year":"1987"},{"key":"10.1016\/0890-5401(89)90063-1_BIB17","series-title":"Proceedings, 3rd Structure in Complexity Theory Conference","first-page":"278","article-title":"The polynomial time hierarchy collapses if the boolean heirarchy collapses","author":"Kadin","year":"1988"},{"key":"10.1016\/0890-5401(89)90063-1_BIB18","series-title":"Proceedings, 6th GI Conference on Theoretical Computer Science","first-page":"269","article-title":"Two remarks on the power of counting","volume":"Vol. 145","author":"Papadimitriou","year":"1983"},{"key":"10.1016\/0890-5401(89)90063-1_BIB19","article-title":"Complexity and Structure","volume":"Vol. 211","author":"Sch\u00f6ning","year":"1986"},{"key":"10.1016\/0890-5401(89)90063-1_BIB20","article-title":"On Some Central Problems in Computational Complexity","author":"Simon","year":"1975"},{"key":"10.1016\/0890-5401(89)90063-1_BIB21","series-title":"Automata, Languages, and Programming","first-page":"480","article-title":"On the difference between one and many","volume":"Vol. 52","author":"Simon","year":"1977"},{"key":"10.1016\/0890-5401(89)90063-1_BIB22","series-title":"19th ACM Symposium on Theory of Computing","first-page":"77","article-title":"Algebraic methods in the theory of lower bounds for boolean circuit complexity","author":"Smolensky","year":"1987"},{"issue":"No. 4","key":"10.1016\/0890-5401(89)90063-1_BIB23","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1137\/0214060","article-title":"On approximation algorithms for #P","volume":"14","author":"Stockmeyer","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(89)90063-1_BIB24","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0020-0190(76)90097-1","article-title":"The relative complexity of checking and evaluating","volume":"5","author":"Valiant","year":"1976","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(89)90063-1_BIB25","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. Scie."},{"issue":"No. 3","key":"10.1016\/0890-5401(89)90063-1_BIB26","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(89)90063-1_BIB28","unstructured":"Wagner, K. \u201cSome Observations on the Connection Between Counting and Recursion,\u201d Technical Report MIP-8611, Universit\u00e4t Passau, Fakult\u00e4t f\u00fcr Mathematik und Informatik."},{"key":"10.1016\/0890-5401(89)90063-1_BIB27","series-title":"Proceedings, 26th IEEE Symposium on Foundations of Computer Science","first-page":"1","article-title":"Separating the polynomial-time hierarchy by oracles","author":"Yao","year":"1985"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900631?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900631?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T15:09:57Z","timestamp":1757516997000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540189900631"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,7]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,7]]}},"alternative-id":["0890540189900631"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(89)90063-1","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1989,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Enumerative counting is hard","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0890-5401(89)90063-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}