{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:19Z","timestamp":1725455899872},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626169"},{"type":"electronic","value":"9783540683421"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0023468","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:06:33Z","timestamp":1132383993000},"page":"307-318","source":"Crossref","is-referenced-by-count":9,"title":["On polynomially D verbose sets"],"prefix":"10.1007","author":[{"given":"Arfst","family":"Nickelsen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"25_CR1","unstructured":"A. Amir, R. Beigel, and W. Gasarch. Some connections between bounded query classes and non-uniform complexity. In Proc. 5th Structure in Complexity Theory, 1990."},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"A. Amir and W. Gasarch. Polynomial terse sets. Information and Computation, 77, 1988.","DOI":"10.1016\/0890-5401(88)90044-2"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"J. Balc\u00e1zar, J. D\u00edaz, and J. Gabarr\u00f3. Structural Complexity I. 1988.","DOI":"10.1007\/978-3-642-97062-7"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"R. Beigel, W. Gasarch, and E. Kinber. Frequency computation and bounded queries. In Proc. 10th Structure in Complexity Theory, 1995.","DOI":"10.1109\/SCT.1995.514852"},{"key":"25_CR5","unstructured":"R. Beigel, M. Kummer, and F. Stephan. Quantifying the amount of verboseness. In Proc. Logical Found. of Comp. Sc. LNCS 620, 1992."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"R. Beigel, M. Kummer, and F. Stephan. Approximable sets. In Proc. 9th Structure in Complexity Theory, 1994.","DOI":"10.1109\/SCT.1994.315822"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"A. Hoene and A. Nickelsen. Counting, selecting, and sorting by query-bounded machines. In Proc. STACS 93. LNCS 665, 1993.","DOI":"10.1007\/3-540-56503-5_22"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"C. Jockusch, Jr. Semirecursive sets and positive reducibility. Trans. Amer. Math. Soc., 131, 1968.","DOI":"10.1090\/S0002-9947-1968-0220595-7"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"M. Kummer and F. Stephan. The power of frequency computation. In FCT 95. LNCS 965, 1995.","DOI":"10.1007\/3-540-60249-6_64"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"M. Kummer. A proof of Beigel's cardinality conjecture. J. of Symb. Logic, 57(2), 1992.","DOI":"10.2307\/2275299"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"M. Ogihara. Polynomial-time membership comparable sets. In Proc. 9th Structure in Complexity Theory, 1994.","DOI":"10.1109\/SCT.1994.315823"},{"key":"25_CR12","unstructured":"S. Rogina. Kardinalit\u00e4tsberechnungen. Studienarbeit, Universt\u00e4t Karlsruhe, 1992."},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"A. Selman. Analogues of semirecursive sets and effective reducibilities to the study of NP complexity. Information and Control, 1, 1982.","DOI":"10.1016\/S0019-9958(82)80084-3"}],"container-title":["Lecture Notes in Computer Science","STACS 97"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023468","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:31:33Z","timestamp":1586568693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023468"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626169","9783540683421"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0023468","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}