{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T13:26:17Z","timestamp":1698499577895},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"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":6010,"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":[[1997,2]]},"DOI":"10.1016\/s0304-3975(95)00260-x","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"195-207","source":"Crossref","is-referenced-by-count":44,"title":["Resource bounded randomness and weakly complete problems"],"prefix":"10.1016","volume":"172","author":[{"given":"Klaus","family":"Ambos-Spies","sequence":"first","affiliation":[]},{"given":"Sebastiaan A.","family":"Terwijn","sequence":"additional","affiliation":[]},{"given":"Zheng","family":"Xizhong","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(95)00260-X_BIB1","series-title":"Computability, Enumerability and Unsolvability: Directions in Recursion Theory","first-page":"1","article-title":"Resource-bounded genericity","volume":"Vol. 224","author":"Ambos-Spies","year":"1996"},{"key":"10.1016\/S0304-3975(95)00260-X_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\/S0304-3975(95)00260-X_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\/S0304-3975(95)00260-X_BIB4","series-title":"Proc. MFCS '94","first-page":"221","article-title":"Genericity and measure for exponential time","volume":"Vol. 841","author":"Ambos-Spies","year":"1994"},{"key":"10.1016\/S0304-3975(95)00260-X_BIB5","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(95)00260-X_BIB6","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0304-3975(95)80030-D","article-title":"Weak Completeness in E and E2","volume":"143","author":"Juedes","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(95)00260-X_BIB7","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\/S0304-3975(95)00260-X_BIB8","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(95)00260-X_BIB9","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\/S0304-3975(95)00260-X_BIB10","series-title":"Proc. 9th Structure in Complexity Theory Conference","first-page":"146","article-title":"Weakly hard problems","author":"Lutz","year":"1994"},{"key":"10.1016\/S0304-3975(95)00260-X_BIB11","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(95)00260-X_BIB12","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. Control"},{"key":"10.1016\/S0304-3975(95)00260-X_BIB13","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/S0019-9958(86)80024-9","article-title":"The density and complexity of polynomial cores for intractable sets","volume":"70","author":"Orponen","year":"1986","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(95)00260-X_BIB14","article-title":"Zuf\u00e4lligkeit und Wahrscheinlichkeit","volume":"Vol. 218","author":"Schnorr","year":"1971"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759500260X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759500260X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:56:46Z","timestamp":1555419406000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759500260X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S030439759500260X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(95)00260-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}