{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T08:36:57Z","timestamp":1649147817114},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"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":5342,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1016\/s0304-3975(97)00114-x","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"225-235","source":"Crossref","is-referenced-by-count":2,"title":["On the size of classes with weak membership properties"],"prefix":"10.1016","volume":"209","author":[{"given":"Marius","family":"Zimand","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00114-X_BIB1","series-title":"Proc. 34th IEEE Symp. on Foundations of Computer Science","first-page":"807","article-title":"Measure on small complexity classes, with applications for BPP","author":"Allender","year":"1994"},{"key":"10.1016\/S0304-3975(97)00114-X_BIB2","article-title":"Query-limited reducibilities","author":"Beigel","year":"1987"},{"key":"10.1016\/S0304-3975(97)00114-X_BIB3","series-title":"Proc. 9th Structure in Complexity Theory Conf. IEEE Computer Society Press","first-page":"12","article-title":"Approximable sets","author":"Beigel","year":"1994"},{"key":"10.1016\/S0304-3975(97)00114-X_BIB4","series-title":"Proc. 10th Structure in Complexity Theory Conf., IEEE Computer Society Press","first-page":"277","article-title":"The power of local self-reductions","author":"Beigel","year":"1995"},{"issue":"3","key":"10.1016\/S0304-3975(97)00114-X_BIB5","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/193820.193828","article-title":"Semi-membership algorithms: some recent advances","volume":"25","author":"Brown","year":"1994","journal-title":"Sigact News"},{"issue":"3","key":"10.1016\/S0304-3975(97)00114-X_BIB6","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1137\/0220033","article-title":"Near-testable sets","volume":"20","author":"Goldsmith","year":"1991","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10.1016\/S0304-3975(97)00114-X_BIB7","doi-asserted-by":"crossref","first-page":"1148","DOI":"10.1137\/0220071","article-title":"On sets with efficient implicit membership tests","volume":"20","author":"Hemachandra","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00114-X_BIB8","unstructured":"L. Hemaspaandra, Z. Jiang, J. Rothe, O. Watanabe, Multiselectivity, in preparation."},{"key":"10.1016\/S0304-3975(97)00114-X_BIB9","series-title":"Proc. 10th Annual Symp. on Theoretical Aspects of Computer Science","first-page":"196","article-title":"Counting, selecting, and sorting by query-bounded machines","volume":"vol. 665","author":"Hoene","year":"1993"},{"key":"10.1016\/S0304-3975(97)00114-X_BIB10","article-title":"Some aspects of frequency computation","author":"Kummer","year":"1991"},{"key":"10.1016\/S0304-3975(97)00114-X_BIB11","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0022-0000(92)90020-J","article-title":"Almost everywhere high nonuniform complexity","volume":"44","author":"Lutz","year":"1992","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00114-X_BIB12","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/0304-3975(94)00023-C","article-title":"Almost every set in exponential time is P-bi-immune","volume":"136","author":"Mayordomo","year":"1994","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"10.1016\/S0304-3975(97)00114-X_BIB13","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1137\/S0097539793258131","article-title":"Polynomial-time membership comparable sets","volume":"24","author":"Ogihara","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00114-X_BIB14","doi-asserted-by":"crossref","unstructured":"P. Orponen, D. Russo, U. Scheming, Optimal approximations and polynomially levelable sets, SIAM J. Comput. 15 (2) 399\u2013408.","DOI":"10.1137\/0215027"},{"key":"10.1016\/S0304-3975(97)00114-X_BIB15","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/S0022-0000(73)80030-3","article-title":"Process complexity and effective random tests","volume":"7","author":"Schnorr","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00114-X_BIB16","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/S0019-9958(82)80084-3","article-title":"Analogues of semirecursive sets and effective reducibilities to the study of NP complexity","volume":"52","author":"Selman","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(97)00114-X_BIB17","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1137\/0221064","article-title":"Polynomial time productivity, approximations, and levelability","volume":"21","author":"Wang","year":"1992","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759700114X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759700114X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T09:02:43Z","timestamp":1555405363000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759700114X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S030439759700114X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00114-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}