{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:20:56Z","timestamp":1737436856308,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_50","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T01:32:38Z","timestamp":1188351158000},"page":"573-584","source":"Crossref","is-referenced-by-count":3,"title":["Partial Information and Special Case Algorithms"],"prefix":"10.1007","author":[{"given":"Arfst","family":"Nickelsen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"50_CR1","doi-asserted-by":"crossref","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, pages 232\u2013242, 1990.","DOI":"10.1109\/SCT.1990.113971"},{"key":"50_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0890-5401(88)90044-2","volume":"77","author":"A. Amir","year":"1988","unstructured":"A. Amir and W. Gasarch. Polynomial terse sets. Information and Computation, 77:27\u201356, 1988.","journal-title":"Information and Computation"},{"issue":"3","key":"50_CR3","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0304-3975(90)90177-J","volume":"73","author":"R. Beigel","year":"1990","unstructured":"R. Beigel. Bi-immunity results for cheatable sets. TCS, 73(3):249\u2013263, 1990.","journal-title":"TCS"},{"issue":"2","key":"50_CR4","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0304-3975(91)90160-4","volume":"84","author":"R. Beigel","year":"1991","unstructured":"R. Beigel. Bounded queries to SAT and the boolean hierarchy. Theoretical Computer Science, 84(2):199\u2013223, 1991.","journal-title":"Theoretical Computer Science"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"R. Beigel, W. Gasarch, and E. Kinber. Frequency computation and bounded queries. In Proc. 10th Structure in Complexity Theory, pages 125\u2013132, 1995.","DOI":"10.1109\/SCT.1995.514852"},{"issue":"2","key":"50_CR6","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1006\/inco.1995.1115","volume":"120","author":"R. Beigel","year":"1995","unstructured":"R. Beigel, M. Kummer, and F. Stephan. Approximable sets. Information and Computation, 120(2):304\u2013314, 1995.","journal-title":"Information and Computation"},{"issue":"1","key":"50_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/inco.1995.1053","volume":"118","author":"R. Beigel","year":"1995","unstructured":"R. Beigel, M. Kummer, and F. Stephan. Quantifying the amount of verboseness. Information and Computation, 118(1):73\u201390, 1995.","journal-title":"Information and Computation"},{"key":"50_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01699457","volume":"18","author":"J. Balc\u00e1zar","year":"1985","unstructured":"J. Balc\u00e1zar and U. Sch\u00f6ning. Bi-immune sets for complexity classes. Mathematical Systems Theory, 18:1\u201310, 1985.","journal-title":"Mathematical Systems Theory"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"J. Goldsmith, D. Joseph, and P. Young. Self-reducible, P-selective, near-testable, and P-cheatable sets: The effect of internal structure on the complexity of a set. In Proceedings 2nd Structure in Complexity Theory Conference, pages 50\u201359. IEEE Computer Society Press, 1987.","DOI":"10.1109\/PSCT.1987.10319254"},{"issue":"3","key":"50_CR10","first-page":"349","volume":"46","author":"J. Goldsmith","year":"1993","unstructured":"J. Goldsmith, D. Joseph, and P. Young. A note on bi-immunity and p- closeness of p-cheatable sets in P\/Poly. JCSS, 46(3):349\u2013362, 1993.","journal-title":"JCSS"},{"issue":"3","key":"50_CR11","first-page":"197","volume":"3","author":"L. A. Hemaspaandra","year":"1997","unstructured":"L. A. Hemaspaandra, Z. Jiang, J. Rothe, and O. Watanabe. Polynomial-time multi-selectivity. J. UCS: Journal of Universal Computer Science, 3(3):197\u2013229, 1997.","journal-title":"J. UCS: Journal of Universal Computer Science"},{"key":"50_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-56503-5_22","volume-title":"Proc. STACS 93","author":"A. Hoene","year":"1993","unstructured":"A. Hoene and A. Nickelsen. Counting, selecting, and sorting by query-bounded machines. In Proc. STACS 93, pages 196\u2013205. LNCS 665, 1993."},{"issue":"2","key":"50_CR13","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1997.2666","volume":"139","author":"M. Hinrichs","year":"1997","unstructured":"M. Hinrichs and G. Wechsung. Time bounded frequency computations. Information and Computation, 139(2):234\u2013257, 1997.","journal-title":"Information and Computation"},{"key":"50_CR14","series-title":"PhD thesis","volume-title":"Reducibilities in recursive function theory","author":"C. G. Jockusch Jr","year":"1966","unstructured":"C. G. Jockusch, Jr. Reducibilities in recursive function theory. PhD thesis, Massachusetts Institute of Technology, Cambridge, Mass., 1966."},{"key":"50_CR15","doi-asserted-by":"crossref","unstructured":"A. Nickelsen. On polynomially D-verbose sets. In Proc. STACS 97, pages 307\u2013318, 1997.","DOI":"10.1007\/BFb0023468"},{"key":"50_CR16","unstructured":"A. Nickelsen. Polynomial Time Partial Information Classes. PhD thesis, Technical University of Berlin, 1999."},{"key":"50_CR17","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF01744288","volume":"13","author":"A. Selman","year":"1979","unstructured":"A. Selman. P-selective sets, tally languages and the behaviour of polynomial time reducibilities on NP. Mathematical Systems Theory, 13:55\u201365, 1979.","journal-title":"Mathematical Systems Theory"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:27:37Z","timestamp":1737397657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_50","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}