{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T18:25:39Z","timestamp":1693419939857},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"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":6102,"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":[[1996,11]]},"DOI":"10.1016\/0304-3975(96)89424-2","type":"journal-article","created":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T01:37:28Z","timestamp":1051753048000},"page":"3-19","source":"Crossref","is-referenced-by-count":40,"title":["Genericity and measure for exponential time"],"prefix":"10.1016","volume":"168","author":[{"given":"Klaus","family":"Ambos-Spies","sequence":"first","affiliation":[]},{"given":"Hans-Christian","family":"Neis","sequence":"additional","affiliation":[]},{"given":"Sebastiaan A.","family":"Terwijn","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(96)89424-2_BIB1","series-title":"Proc. First Structure in Complexity Theory Conf.","first-page":"23","article-title":"Randomness, relativizations, and polynomial reducibilities","volume":"Vol. 223","author":"Ambos-Spies","year":"1986"},{"key":"10.1016\/0304-3975(96)89424-2_BIB2","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":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(96)89424-2_BIB3","series-title":"Proc. CSL '87","first-page":"1","article-title":"Diagonalizing over deterministic polynomial time","volume":"Vol. 329","author":"Ambos-Spies","year":"1988"},{"key":"10.1016\/0304-3975(96)89424-2_BIB4_1","doi-asserted-by":"crossref","unstructured":"K. Ambos-Spies, S.A. Terwijn and X. Zheng, Resource bounded randomness and weakly complete problems, Theort. Comput. Sci., to appear","DOI":"10.1007\/3-540-58325-4_201"},{"key":"10.1016\/0304-3975(96)89424-2_BIB4_2","series-title":"Proc. ISAAC '94","first-page":"369","volume":"Vol. 834","author":"Ambos-Spies","year":"1994"},{"key":"10.1016\/0304-3975(96)89424-2_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01699457","article-title":"Bi-immune sets for complexity classes","volume":"18","author":"Balcazar","year":"1985","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(96)89424-2_BIB6","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/0210008","article-title":"Relative to a random oracle A, PA \u2260 NPA \u2260 co-NPA with probability 1","volume":"10","author":"Bennett","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(96)89424-2_BIB7","article-title":"On diagonalizations over complexity classes","author":"Fleischhack","year":"1985","journal-title":"Dissertation, Universit\u00e4t Dortmund, Dept. Comput. Sci. Tech. Rep. 210"},{"key":"10.1016\/0304-3975(96)89424-2_BIB8","series-title":"Proc. MFCS 1986","first-page":"341","article-title":"P-genericity and strong P-genericity","volume":"Vol. 233","author":"Fleischhack","year":"1986"},{"key":"10.1016\/0304-3975(96)89424-2_BIB9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0019-9958(86)80012-2","article-title":"On relativized exponential and probabilistic complexity classes","volume":"71","author":"Heller","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(96)89424-2_BIB10","series-title":"Recursion Theory: its Generalisations and Applications","first-page":"110","article-title":"Degrees of generic sets","volume":"Vol. 45","author":"Jockusch","year":"1980"},{"key":"10.1016\/0304-3975(96)89424-2_BIB11","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\/0304-3975(96)89424-2_BIB12","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","article-title":"A comparison of polynomial time reducibilities","volume":"1","author":"Ladner","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(96)89424-2_BIB13","article-title":"On the polynomial time bounded measure of one-truth-table degrees and p-selectivity","author":"Lindner","year":"1993"},{"key":"10.1016\/0304-3975(96)89424-2_BIB14","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1137\/0219076","article-title":"Category and measure in complexity classes","volume":"19","author":"Lutz","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(96)89424-2_BIB15","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\/0304-3975(96)89424-2_BIB16","series-title":"Proc. 8th Structure in Complexity Theory Conf.","first-page":"158","article-title":"The quantitative structure of exponential time","author":"Lutz","year":"1993"},{"key":"10.1016\/0304-3975(96)89424-2_BIB17","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\/0304-3975(96)89424-2_BIB18","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(95)00189-1","article-title":"Cook versus Karp-Levin: Separating completeness notions if NP is not small","volume":"164","author":"Lutz","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(96)89424-2_BIB19","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","article-title":"The definition of random sequences","volume":"9","author":"Martin-L\u00f6f","year":"1966","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(96)89424-2_BIB20","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/0304-3975(94)00023-C","article-title":"Almost every set in exponential time is P-bi-immune","volume":"136","author":"Mayordomo","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(96)89424-2_BIB21","article-title":"Zuf\u00e4lligkeit und Wahrscheinlichkeit","volume":"Vol. 218","author":"Schnorr","year":"1971"},{"key":"10.1016\/0304-3975(96)89424-2_BIB22","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(91)90314-R","article-title":"Polynomial-time reducibilities and \u201calmost all\u201d oracle sets","volume":"81","author":"Tang","year":"1991","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397596894242?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397596894242?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T05:26:53Z","timestamp":1556256413000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397596894242"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["0304397596894242"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(96)89424-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}