{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:50Z","timestamp":1742617190524,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602491"},{"type":"electronic","value":"9783540447702"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60249-6_64","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:57:42Z","timestamp":1330279062000},"page":"323-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The power of frequency computation"],"prefix":"10.1007","author":[{"given":"Martin","family":"Kummer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0890-5401(88)90044-2","volume":"77","author":"A. Amir","year":"1988","unstructured":"A. Amir, W. I. Gasarch. Polynomial terse sets. Information and Computation, 77:37\u201356, 1988.","journal-title":"Information and Computation"},{"key":"27_CR2","doi-asserted-by":"crossref","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. Theoretical Computer Science, 73:249\u2013263, 1990.","journal-title":"Theoretical Computer Science"},{"key":"27_CR3","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0304-3975(91)90160-4","volume":"83","author":"R. Beigel","year":"1991","unstructured":"R. Beigel. Bounded queries to SAT and the boolean hierarchy. Theoretical Computer Science, 83:199\u2013223, 1991.","journal-title":"Theoretical Computer Science"},{"key":"27_CR4","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1006\/inco.1993.1014","volume":"103","author":"R. Beigel","year":"1993","unstructured":"R. Beigel, W. I. Gasarch, J. Gill, J. C. Owings, Jr. Terse, superterse, and verbose sets. Information and Computation, 103:68\u201385, 1993.","journal-title":"Information and Computation"},{"key":"27_CR5","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BFb0023860","volume":"620","author":"R. Beigel","year":"1992","unstructured":"R. Beigel, M. Kummer, F. Stephan. Quantifying the amount of verboseness. To appear in: Information and Computation. (A preliminary version appeared in Logical Foundations of Computer Science \u2014 Tver'92, Lecture Notes in Computer Science 620, pp. 21\u201332, 1992).","journal-title":"Lecture Notes in Computer Science"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"R. Beigel, M. Kummer, F. Stephan. Approximable sets. To appear in: Information and Computation. (A preliminary version appeared in Proceedings Structure in Complexity Theory, Ninth Annual Conference, pp. 12\u201323, IEEE Press, 1994.)","DOI":"10.1109\/SCT.1994.315822"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"J. Case, S. Kaufmann, E. Kinber, M. Kummer. Learning recursive functions from approximations. In Proceedings EuroCOLT'95, Lecture Notes in Computer Science 904, pp. 140\u2013153, 1995. Springer-Verlag","DOI":"10.1007\/3-540-59119-2_174"},{"key":"27_CR8","unstructured":"A. N. D\u00ebgtev. On (m, n)-computable sets. In Algebraic Systems (Edited by D.I Moldavanskij). Ivanova Gos. Univ. 88\u201399, 1981. (Russian) (MR 86b:03049)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"W. I. Gasarch. Bounded queries in recursion theory: a survey. In Proceedings of the Sixth Annual Structure in Complexity Theory Conference, pp. 62\u201378, IEEE Press, 1991.","DOI":"10.1109\/SCT.1991.160245"},{"key":"27_CR10","doi-asserted-by":"crossref","first-page":"677","DOI":"10.2307\/2275300","volume":"57","author":"V. Harizanov","year":"1992","unstructured":"V. Harizanov, M. Kummer, J. C. Owings, Jr. Frequency computation and the cardinality theorem. J. Symb. Log., 57:677\u2013681, 1992.","journal-title":"J. Symb. Log."},{"key":"27_CR11","unstructured":"E. B. Kinber. Frequency-computable functions and frequency-enumerable sets. Candidate Dissertation, Riga, 1975. (Russian)"},{"key":"27_CR12","unstructured":"E. B. Kinber. On frequency real-time computations. In Teoriya Algorithmov i Programm, Vol. 2 (Edited by Ya. M. Barzdin). Latv. Valst. Gos. Univ. pp. 174\u2013182, 1975. (Russian) (MR 58:3624, Zbl 335:02023)"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"E. Kinber, C. Smith, M. Velauthapillai, R. Wiehagen. On learning multiple concepts in parallel. In Proceedings COLT'93, pp. 175\u2013181, ACM Press, 1993.","DOI":"10.1145\/168304.168328"},{"key":"27_CR14","doi-asserted-by":"crossref","first-page":"682","DOI":"10.2307\/2275299","volume":"57","author":"M. Kummer","year":"1992","unstructured":"M. Kummer. A proof of Beigel's cardinality conjecture. J. Symb. Log., 57:682\u2013687, 1992.","journal-title":"J. Symb. Log."},{"key":"27_CR15","unstructured":"M. Kummer, F. Stephan. Some aspects of frequency computation. Technical Report No. 21\/91, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, 1991."},{"key":"27_CR16","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BFb0022573","volume":"713","author":"M. Kummer","year":"1993","unstructured":"M. Kummer, F. Stephan. Recursion theoretic properties of frequency computation and bounded queries. To appear in: Information and Computation (A preliminary version appeared in Third Kurt G\u00f6del Colloquium, Lecture Notes in Computer Science 713, pp. 243\u2013254, 1993).","journal-title":"Lecture Notes in Computer Science"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"M. Kummer, F. Stephan. Inclusion problems in parallel learning and games. In Proceedings COLT'94, pp. 287\u2013298, ACM Press, 1994.","DOI":"10.1145\/180139.181156"},{"key":"27_CR18","volume-title":"Manuscript","author":"T. McNicholl","year":"1994","unstructured":"T. McNicholl. A solution to the inclusion problem for frequency classes. Manuscript, 66 pp., Dept. of Mathematics, George Washington University, Washington DC, June 1994."},{"key":"27_CR19","unstructured":"G. F. Rose. An extended notion of computability. In Abstr. Intern. Congr. for Logic, Meth., and Phil. of Science, Stanford, California, 1960."},{"key":"27_CR20","first-page":"25","volume":"2","author":"B. A. Trakhtenbrot","year":"1963","unstructured":"B. A. Trakhtenbrot. On frequency computation of functions. Algebra i Logika, 2:25\u201332, 1963. (Russian)","journal-title":"Algebra i Logika"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60249-6_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:56:45Z","timestamp":1742597805000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60249-6_64"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602491","9783540447702"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-60249-6_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"30 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}