{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T19:56:54Z","timestamp":1772827014048,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5403,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1016\/s0304-3975(98)00067-x","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"245-259","source":"Crossref","is-referenced-by-count":5,"title":["Genericity and randomness over feasible probability measures"],"prefix":"10.1016","volume":"207","author":[{"given":"Amy K.","family":"Lorentz","sequence":"first","affiliation":[]},{"given":"Jack H.","family":"Lutz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00067-X_BIB1","series-title":"Lecture at the Annual Meeting of the Special Interest Group \u201cLogik in der Informatik\u201d of the Gesellschaft f\u00fcr Informatik (GI)","article-title":"Largeness axioms for NP","author":"Ambos-Spies","year":"1994"},{"key":"10.1016\/S0304-3975(98)00067-X_BIB2","first-page":"1","article-title":"Resource-bounded genericity","volume":"vol. 224","author":"Ambos-Spies","year":"1996"},{"key":"10.1016\/S0304-3975(98)00067-X_BIB3","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0304-3975(87)90053-3","article-title":"Diagonalizations over polynomial time computable sets","volume":"51","author":"Ambos-Spies","year":"1987","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00067-X_BIB4","series-title":"Proc. Computer Science Logic '87","first-page":"1","article-title":"Diagonalizing over deterministic polynomial time","author":"Ambos-Spies","year":"1988"},{"key":"10.1016\/S0304-3975(98)00067-X_BIB5","series-title":"Complexity, Logic and Recursion Theory","first-page":"1","article-title":"Resource-bounded measure and randomness","author":"Ambos-Spies","year":"1996"},{"key":"10.1016\/S0304-3975(98)00067-X_BIB6","series-title":"Proc. 13th Symp. on Theoretical Aspects of Computer Science","first-page":"63","article-title":"Resource-bounded balanced genericity, stochasticity, and weak randomness","author":"Ambos-Spies","year":"1996"},{"key":"10.1016\/S0304-3975(98)00067-X_BIB7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(96)89424-2","article-title":"Genericity and measure for exponential time","volume":"168","author":"Ambos-Spies","year":"1996","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00067-X_BIB8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0304-3975(95)00260-X","article-title":"Resource bounded randomness and weakly complete problems","volume":"172","author":"Ambos-Spies","year":"1997","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00067-X_BIB9","series-title":"Proc. 10th Annual Structure in Complexity Theory Conf, IEEE Computer Society Press","first-page":"193","article-title":"A note on genericity and bi-immunity","author":"Balc\u00e1zar","year":"1995"},{"key":"10.1016\/S0304-3975(98)00067-X_BIB10","doi-asserted-by":"crossref","unstructured":"J.M. Breutzmann, J.H. Lutz, Equivalence of measures of complexity classes, SIAM J. Comput., to appear.","DOI":"10.1007\/BFb0023487"},{"key":"10.1016\/S0304-3975(98)00067-X_BIB11","series-title":"Proc. 10th Structure in Complexity Theory Conf., IEEE Computer Society Press","first-page":"182","article-title":"Resource-bounded category: a stronger approach","author":"Fenner","year":"1995"},{"issue":"2","key":"10.1016\/S0304-3975(98)00067-X_BIB12","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1137\/S0097539792238133","article-title":"The complexity and distribution of hard problems","volume":"24","author":"Juedes","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00067-X_BIB13","article-title":"On the polynomial time bounded measure of one-truth-table degrees and p-selectivity","author":"Lindner","year":"1993"},{"key":"10.1016\/S0304-3975(98)00067-X_BIB14","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0022-0000(92)90020-J","article-title":"Almost everywhere high nonuniform complexity","volume":"44","author":"Lutz","year":"1992","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(98)00067-X_BIB15","series-title":"Complexity Theory Retrospective II","first-page":"225","article-title":"The quantitative structure of exponential time","author":"Lutz","year":"1997"},{"key":"10.1016\/S0304-3975(98)00067-X_BIB16","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1137\/S0097539792237498","article-title":"Measure, stochasticity and the density of hard languages","volume":"23","author":"Lutz","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00067-X_BIB17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00538763","article-title":"Klassifikation der Zufallsgesetze nach komplexit\u00e4t und Ordnung","volume":"16","author":"Schnorr","year":"1970","journal-title":"Z. Wahrscheinlichkeitstheorie verw. Geb."},{"key":"10.1016\/S0304-3975(98)00067-X_BIB18","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/BF01694181","article-title":"A unified approach to the definition of random sequences","volume":"5","author":"Schnorr","year":"1971","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(98)00067-X_BIB19","article-title":"Zuf\u00e4lligkeit und Wahrscheinlichkeit","volume":"218","author":"Schnorr","year":"1971","journal-title":"Lecture Notes in Mathematics"},{"key":"10.1016\/S0304-3975(98)00067-X_BIB20","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/S0022-0000(73)80030-3","article-title":"Process complexity and effective random tests","volume":"7","author":"Schnorr","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(98)00067-X_BIB21","series-title":"Basic Problems in Methodology and Linguistics","first-page":"193","article-title":"A survey of the theory of random sequences","author":"Schnorr","year":"1977"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759800067X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759800067X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T13:02:15Z","timestamp":1555419735000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759800067X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S030439759800067X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00067-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}