{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:03Z","timestamp":1725664503969},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540609223"},{"type":"electronic","value":"9783540497233"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60922-9_6","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:04:52Z","timestamp":1330290292000},"page":"61-74","source":"Crossref","is-referenced-by-count":7,"title":["Resource-bounded balanced genericity, stochasticity and weak randomness"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Ambos-Spies","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elvira","family":"Mayordomo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongge","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xizhong","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"K. Ambos-Spies. Resource-bounded genericity. To appear in Computability, Enumerability and Unsolvability: Directions in Recursion Theory (B. Cooper et al., Eds.), Cambridge University Press. Extended abstract in Proc. 10th Conf. on Structure in Complexity Theory, pages 162\u2013181. IEEE Computer Society Press, 1995.","DOI":"10.1109\/SCT.1995.514855"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"K. Ambos-Spies, H. Fleischhack, and H. Huwig. Diagonalizations over deterministic polynomial time. In Proc. of CSL 87, Lecture Notes in Comput. Sci. 329, pages 1\u201316. Springer Verlag, 1988.","DOI":"10.1007\/3-540-50241-6_25"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"K. Ambos-Spies, H.-C. Neis, and S. A. Terwijn. Genericity and measure for exponential time. Theoret. Comput. Sci. (to appear). Extended abstract in Proc. MFCS 94, Lecture Notes in Comput. Sci. 841, pages 221\u2013232. Springer Verlag, 1994.","DOI":"10.1007\/3-540-58338-6_69"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"K. Ambos-Spies, S. A. Terwijn, and X. Zheng. Resource-bounded randomness and weakly complete problems. Theoret. Comput. Sci. (to appear). Extended abstract in Proc. 5th ISAAC, Lecture Notes in Comput. Sci. 834, pages 369\u2013377. Springer Verlag, 1994.","DOI":"10.1007\/3-540-58325-4_201"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"J. L. Balcazar and E. Mayordomo. A note on genericity and bi-immunity. In Proc. 10th Conf. on Structure in Complexity Theory, pages 193\u2013196. IEEE Computer Society Press, 1995.","DOI":"10.1109\/SCT.1995.514857"},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1090\/S0002-9904-1940-07154-X","volume":"45","author":"A. Church","year":"1940","unstructured":"A. Church. On the concept of a random sequence. Bull. Amer. Math. Soc., 45:130\u2013135, 1940.","journal-title":"Bull. Amer. Math. Soc."},{"key":"6_CR7","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1145\/321541.321551","volume":"16","author":"R. A. Paola Di","year":"1969","unstructured":"R. A. Di Paola. Random sets in subrecursive hierarchies. J. Assoc. Comput. Mach., 16:621\u2013630, 1969.","journal-title":"J. Assoc. Comput. Mach."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"S. A. Fenner. Notions of resource-bounded category and genericity. In Proc. 6th Conf. on Structure in Complexity Theory, pages 196\u2013221. IEEE Computer Society Press, 1991.","DOI":"10.1109\/SCT.1991.160262"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"S. A. Fenner. Resource-bounded Baire category: A stronger approach. In Proc. 10th Conf. on Structure in Complexity Theory, pages 182\u2013192. IEEE Computer Society Press, 1995.","DOI":"10.1109\/SCT.1995.514856"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(95)80016-6","volume":"143","author":"D. Juedes","year":"1995","unstructured":"D. Juedes and J. H. Lutz. Weak completeness in E and E 2. Theoret. Comput. Sci., 143:149\u2013158, 1995.","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0304-3975(86)90081-2","volume":"48","author":"K. Ko","year":"1986","unstructured":"K. Ko. On the notion of infinite pseudorandom sequences. Theoret. Comput. Sci., 48:9\u201333, 1986.","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1137\/0219076","volume":"19","author":"J. H. Lutz","year":"1990","unstructured":"J. H. Lutz. Category and measure in complexity classes. SIAM J. Comput., 19:1100\u20131131, 1990.","journal-title":"SIAM J. Comput."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/0022-0000(92)90020-J","volume":"44","author":"J. H. Lutz","year":"1992","unstructured":"J. H. Lutz. Almost everywhere high nonuniform complexity. J. Comput. and System Sci., 44:220\u2013258, 1992.","journal-title":"J. Comput. and System Sci."},{"key":"6_CR14","unstructured":"E. Mayordomo. Contributions to the study of resource-bounded measure. PhD thesis, Barcelona, 1994."},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"C. P. Schnorr. Zuf\u00e4lligkeit und Wahrscheinlichkeit. Eine algorithmische Begr\u00fcndung der Wahrscheinlichkeittheorie. Lecture Notes in Math. 21. Springer Verlag, 1971.","DOI":"10.1007\/BFb0112458"},{"key":"6_CR16","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1070\/RM1990v045n01ABEH002321","volume":"45","author":"V. A. Uspenskii","year":"1990","unstructured":"V. A. Uspenskii, A. L. Semenov, and A. Kh. Shen. Can an individual sequence of zeros and ones be random? Russian Math. Surveys, 45:121\u2013189, 1990.","journal-title":"Russian Math. Surveys"},{"key":"6_CR17","volume-title":"\u00c8tude Critique de la Notion de Collectif","author":"J. Ville","year":"1939","unstructured":"J. Ville. \u00c8tude Critique de la Notion de Collectif. Gauthiers-Villars, Paris, 1939."},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BF01203155","volume":"5","author":"R. Mises von","year":"1919","unstructured":"R. von Mises. Grundlagen der Wahrscheinlichkeitsrechnung. Math. Z., 5:52\u201389, 1919.","journal-title":"Math. Z."},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"R. Wilber. Randomness and the density of hard problems. In Proc. 24th IEEE Symp. on Foundations of Computer Science, pages 335\u2013342, 1983.","DOI":"10.1109\/SFCS.1983.49"}],"container-title":["Lecture Notes in Computer Science","STACS 96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60922-9_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:02:40Z","timestamp":1605646960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60922-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609223","9783540497233"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-60922-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}