{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:54:52Z","timestamp":1757627692891,"version":"3.44.0"},"reference-count":26,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,2,20]],"date-time":"1999-02-20T00:00:00Z","timestamp":919468800000},"content-version":"vor","delay-in-days":933,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0304-3975(95)00149-2","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"177-192","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"title":["Frequency computation and bounded queries"],"prefix":"10.1016","volume":"163","author":[{"given":"Richard","family":"Beigel","sequence":"first","affiliation":[]},{"given":"William","family":"Gasarch","sequence":"additional","affiliation":[]},{"given":"Efim","family":"Kinber","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00149-2_BIB1","series-title":"Proc. 9th Ann. Conf. on Structure in Complexity Theory","article-title":"Polynomial time truth-table reductions to p-selective sets","author":"Agrawal","year":"1994"},{"key":"10.1016\/0304-3975(95)00149-2_BIB2","series-title":"Proc. 5th Ann. Conf. on Structure in Complexity Theory","first-page":"232","article-title":"Some connections between bounded query classes and nonuniform complexity","author":"Amir","year":"1990"},{"article-title":"Query-limited reducibilities","year":"1987","author":"Beigel","key":"10.1016\/0304-3975(95)00149-2_BIB3"},{"key":"10.1016\/0304-3975(95)00149-2_BIB4","series-title":"Proc. 2nd Ann. Conf. on Structure in Complexity Theory","first-page":"28","article-title":"A structural theorem that depends quantitatively on the complexity of SAT","author":"Beigel","year":"1987"},{"key":"10.1016\/0304-3975(95)00149-2_BIB5","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1006\/inco.1993.1014","article-title":"Terse, superterse, and verbose sets","volume":"103","author":"Beigel","year":"1993","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(95)00149-2_BIB6","unstructured":"R. Beigel, M. Kummer and F. Stephan, Approximable sets, to appear. An earlier version appeared in STRUCTURES 1994."},{"key":"10.1016\/0304-3975(95)00149-2_BIB7","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/0890-5401(89)90063-1","article-title":"Enumerative counting is hard","volume":"82","author":"Cai","year":"1989","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(95)00149-2_BIB8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0012-365X(85)90020-2","article-title":"Good coverings of Hamming spaces with spheres","volume":"56","author":"Cohen","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(95)00149-2_BIB9","first-page":"338","article-title":"Covering radius \u2014 survey and recent results","volume":"IT-31","author":"Cohen","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(95)00149-2_BIB10","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1109\/TIT.1986.1057227","article-title":"Further results on the covering radius of codes","volume":"IT-32","author":"Cohen","year":"1986","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(95)00149-2_BIB11","series-title":"Proc. 6th Ann. Conf. on Structure in Complexity Theory","first-page":"62","article-title":"Bounded queries in recursion theory: A survey","author":"Gasarch","year":"1991"},{"key":"10.1016\/0304-3975(95)00149-2_BIB12","unstructured":"W. Gasarch, M.W. Krentel and K. Rappoport, OptP-completeness as the normal behavior of NP-complete problems, Math. Systems Theory, to appear."},{"key":"10.1016\/0304-3975(95)00149-2_BIB13","doi-asserted-by":"crossref","first-page":"682","DOI":"10.2307\/2275300","article-title":"Frequency computations and the cardinality theorem","volume":"57","author":"Harizanov","year":"1992","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(95)00149-2_BIB14","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1109\/18.75253","article-title":"Modified bounds for covering codes","volume":"IT-37","author":"Honkala","year":"1991","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(95)00149-2_BIB15","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1090\/S0002-9947-1968-0220595-7","article-title":"Semirecursive sets and positive reducibility","volume":"131","author":"Jockusch","year":"1968","journal-title":"Trans. AMS"},{"key":"10.1016\/0304-3975(95)00149-2_BIB16","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","article-title":"The complexity of optimization problems","volume":"36","author":"Krentel","year":"1988","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0304-3975(95)00149-2_BIB17","doi-asserted-by":"crossref","first-page":"677","DOI":"10.2307\/2275299","article-title":"A proof of Beigel's cardinality conjecture","volume":"57","author":"Kummer","year":"1992","journal-title":"J. Symbolic Logic"},{"article-title":"Some aspects of frequency computation","year":"1991","author":"Kummer","key":"10.1016\/0304-3975(95)00149-2_BIB18"},{"key":"10.1016\/0304-3975(95)00149-2_BIB19","doi-asserted-by":"crossref","DOI":"10.1002\/malq.19940400209","article-title":"Effective search problems","volume":"40","author":"Kummer","year":"1994","journal-title":"Math. Logic Quart."},{"key":"10.1016\/0304-3975(95)00149-2_BIB20","series-title":"Proc. 9th Ann. Conf. on Structure in Complexity Theory","article-title":"Polynomial-time membership comparable sets","author":"Ogiwara","year":"1994"},{"year":"1967","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","key":"10.1016\/0304-3975(95)00149-2_BIB21"},{"key":"10.1016\/0304-3975(95)00149-2_BIB22","series-title":"Abstr. Internat. Congress for Logic, Methodology, and Philosophy of Science","first-page":"14","article-title":"An extended notion of computability","author":"Rose","year":"1960"},{"key":"10.1016\/0304-3975(95)00149-2_BIB23","article-title":"Theory of Formal Systems","volume":"Vol. 47","author":"Smullyan","year":"1961"},{"key":"10.1016\/0304-3975(95)00149-2_BIB24","series-title":"Perspectives in Mathematical Logic","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7_3","article-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"},{"key":"10.1016\/0304-3975(95)00149-2_BIB25","first-page":"25","article-title":"On the frequency computation of functions","volume":"2","author":"Trakhtenbrot","year":"1964","journal-title":"Algebra Logika"},{"key":"10.1016\/0304-3975(95)00149-2_BIB26","first-page":"237","article-title":"Improved sphere bounds on the covering radius of codes","volume":"IT-34","author":"Wee","year":"1988","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001492?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001492?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:17:55Z","timestamp":1757477875000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001492"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0304397595001492"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00149-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1996,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Frequency computation and bounded queries","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(95)00149-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}