{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:03:55Z","timestamp":1787504635765,"version":"build-2736575974"},"reference-count":32,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7106,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1016\/s0022-0000(05)80024-8","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T07:18:35Z","timestamp":1124522315000},"page":"116-148","source":"Crossref","is-referenced-by-count":113,"title":["Gap-definable counting classes"],"prefix":"10.1016","volume":"48","author":[{"given":"Stephen A.","family":"Fenner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lance J.","family":"Fortnow","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stuart A.","family":"Kurtz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80024-8_bib1","series-title":"Structure in Complexity Theory","first-page":"1","article-title":"The complexity of sparse sets in P","volume":"Vol. 223","author":"Allender","year":"1986"},{"issue":"No. 1","key":"10.1016\/S0022-0000(05)80024-8_bib2_1","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01200057","article-title":"Arithmetization: A new method in structural complexity theory","volume":"1","author":"Babai","year":"1991","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0022-0000(05)80024-8_bib2_2","series-title":"Proceedings, 31st Annual IEEE Symposium on Foundations of Computer Science","first-page":"26","year":"1990"},{"key":"10.1016\/S0022-0000(05)80024-8_bib3","series-title":"Proceedings, 7th Annual IEEE Structure in Complexity Theory Conference","first-page":"14","article-title":"Perceptrons, PP and the polynomial hierarchy","author":"Beigel","year":"1992"},{"key":"10.1016\/S0022-0000(05)80024-8_bib4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(92)90084-S","article-title":"Counting classes: Thresholds, parity, mods, and fewness","volume":"103","author":"Beigel","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80024-8_bib5","series-title":"Proceedings, Seventh Annual Symposium on Theoretical Aspects of Computer Science","first-page":"49","article-title":"Counting classes: Thresholds, parity, mods, and fewness,","volume":"Vol. 415","author":"Beigel","year":"1990"},{"key":"10.1016\/S0022-0000(05)80024-8_bib6","series-title":"Proceedings, 23rd Annual ACM Symposium on Theory of Computing","first-page":"1","article-title":"PP is closed under intersection","author":"Beigel","year":"1991"},{"issue":"No. 2","key":"10.1016\/S0022-0000(05)80024-8_bib7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02090768","article-title":"On the power of parity polynomial time","volume":"23","author":"Cai","year":"1990","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0022-0000(05)80024-8_bib8","series-title":"Proceedings, 10th Annual Symposium on Theoretical Aspects of Computer Science","first-page":"484","article-title":"Gap-definability as a closure property","volume":"Vol. 665","author":"Fenner","year":"1993"},{"key":"10.1016\/S0022-0000(05)80024-8_bib9","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic complexity classes","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80024-8_bib10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0304-3975(86)90165-9","article-title":"On the construction of parallel computers from various bases of Boolean functions","volume":"43","author":"Goldschlager","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80024-8_bib11","series-title":"Concrete Mathematics","author":"Graham","year":"1989"},{"key":"10.1016\/S0022-0000(05)80024-8_bib12","series-title":"Proceedings, 6th Annual IEEE Structure in Complexity Theory Conference","first-page":"43","article-title":"The power of witness reduction","author":"Gupta","year":"1991"},{"key":"10.1016\/S0022-0000(05)80024-8_bib13","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0022-0000(05)80024-8_bib14","first-page":"62","article-title":"Strukturelle Komplexit\u00e4t von Anzahlproblemen","author":"K\u00f6bler","year":"1989"},{"issue":"No. 2","key":"10.1016\/S0022-0000(05)80024-8_bib15","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/0022-0000(92)90022-B","article-title":"Turing machines with few accepting computations and low sets for PP","volume":"44","author":"K\u00f6bler","year":"1992","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80024-8_bib16","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF00276023","article-title":"On counting and approximation","volume":"26","author":"K\u00f6bler","year":"1989","journal-title":"Acta Inform."},{"key":"10.1016\/S0022-0000(05)80024-8_bib17","series-title":"Proceedings, Ninth Annual Symposium on Theoretical Aspects of Computer Science","first-page":"401","article-title":"Graph Isomorphism is low for PP","volume":"Vol. 577","author":"K\u00f6bler","year":"1992"},{"key":"10.1016\/S0022-0000(05)80024-8_bib18","series-title":"Complexity Theory Retrospective","first-page":"147","article-title":"Applications of Kolmogorov complexity in the theory of computation","author":"Li","year":"1990"},{"key":"10.1016\/S0022-0000(05)80024-8_bib19","series-title":"Proceedings, 6th Annual IEEE Structure in Complexity Theory Conference","first-page":"16","article-title":"A complexity theory of feasible closure properties","author":"Ogiwara","year":"1991"},{"key":"10.1016\/S0022-0000(05)80024-8_bib20","first-page":"269","article-title":"Two Remarks on the Power of Counting","volume":"Vol. 145","author":"Papadimitriou","year":"1983"},{"key":"10.1016\/S0022-0000(05)80024-8_bib21","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/S0022-0000(05)80024-8_bib22_1","first-page":"84","article-title":"Probabilistic complexity classes and lowness","volume":"39","author":"Sch\u00f6ning","year":"1988"},{"key":"10.1016\/S0022-0000(05)80024-8_bib22_2","series-title":"Proceedings, 2nd Annual IEEE Structure in Complexity Theory Conference","first-page":"2","year":"1987"},{"key":"10.1016\/S0022-0000(05)80024-8_bib23","article-title":"On Some Central Problems in Computational Complexity","author":"Simon","year":"1975"},{"key":"10.1016\/S0022-0000(05)80024-8_bib24","series-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"},{"key":"10.1016\/S0022-0000(05)80024-8_bib25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80024-8_bib26","unstructured":"S. Toda, private communication, 1990."},{"issue":"No. 5","key":"10.1016\/S0022-0000(05)80024-8_bib27","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1137\/0220053","article-title":"PP is as hard as the polynomial-time hierarchy","volume":"20","author":"Toda","year":"1991","journal-title":"SIAM J. Comput."},{"issue":"No. 2","key":"10.1016\/S0022-0000(05)80024-8_bib28","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1137\/0221023","article-title":"Counting classes are at least as hard as the polynomial-time hierarchy","volume":"21","author":"Toda","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80024-8_bib29","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"5","author":"Valiant","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80024-8_bib30","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00289117","article-title":"The complexity of combinatorial problems with succinct input representation","volume":"23","author":"Wagner","year":"1986","journal-title":"Acta Inform."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800248?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800248?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,29]],"date-time":"2024-01-29T01:00:11Z","timestamp":1706490011000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800248"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["S0022000005800248"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80024-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}