{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:10:10Z","timestamp":1762297810366},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583257"},{"type":"electronic","value":"9783540486534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58325-4_201","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:44:33Z","timestamp":1330271073000},"page":"369-377","source":"Crossref","is-referenced-by-count":11,"title":["Resource bounded randomness and weakly complete problems"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"43_CR1","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0304-3975(87)90053-3","volume":"51","author":"K. Ambos-Spies","year":"1987","unstructured":"K. Ambos-Spies, H. Fleischhack, and H. Huwig, Diagonalizations over polynomial time computable sets, Theor. Comput. Sci. 51 (1987) 177\u2013204.","journal-title":"Theor. Comput. Sci."},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"K. Ambos-Spies, H. Fleischhack, and H. Huwig, Diagonalizing over deterministic polynomial time, in: Proc. CSL '87, Lecture Notes Comput. Sci. 329 (1988) 1\u201316, Springer Verlag.","DOI":"10.1007\/3-540-50241-6_25"},{"key":"#cr-split#-43_CR3.1","unstructured":"K. Ambos-Spies, H-C. Neis, and S. A. Terwijn, Genericity and measure for exponential time, (in preparation;"},{"key":"#cr-split#-43_CR3.2","unstructured":"an extended abstract appears in the Proceedings of MFCS '94, Lecture Notes Comput. Sci., Springer Verlag)."},{"key":"43_CR4","unstructured":"D. W. Juedes and J. H. Lutz, The complexity and distribution of hard problems, Tech. Rep. 92-23, Dept. Comput. Sci., Iowa State University, (1992) (submitted for publication)."},{"key":"43_CR5","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 (1990) 1100\u20131131.","journal-title":"SIAM J. Comput."},{"key":"43_CR6","doi-asserted-by":"crossref","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. Comp. System Sci. 44 (1992) 220\u2013258.","journal-title":"J. Comp. System Sci."},{"key":"43_CR7","unstructured":"J. H. Lutz, The quantative structure of exponential time, in: Proc. 8th Structure in Complexity Theory Conference (1993) 158\u2013175, IEEE Comput. Sci. Press."},{"key":"43_CR8","unstructured":"J. H. Lutz, Weakly hard problems, (preliminary version, April 1993, submitted for publication; extended abstract to appear in Proc. 9th Structure in Complexity Theory Conference, 1994)."},{"key":"43_CR9","unstructured":"J. H. Lutz and E. Mayordomo, Measure, stochasticity, and the density of hard languages, (to appear in SIAM J. Comput.)."},{"key":"43_CR10","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","volume":"9","author":"P. Martin-L\u00f6f","year":"1966","unstructured":"P. Martin-L\u00f6f, The definition of random sequences, Information and Control 9 (1966) 602\u2013619.","journal-title":"Information and Control"},{"key":"43_CR11","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/S0019-9958(86)80024-9","volume":"70","author":"P. Orponen","year":"1986","unstructured":"P. Orponen and U. Sch\u00f6ning, The density and complexity of polynomial cores for intractable sets, Information and Control 70 (1986) 54\u201368.","journal-title":"Information and Control"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"C. P. Schnorr, Zuf\u00e4lligkeit und Wahrscheinlichkeit, Lect. Notes Math. 218 (1971), Springer Verlag.","DOI":"10.1007\/BFb0112458"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58325-4_201.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:19:31Z","timestamp":1605647971000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58325-4_201"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583257","9783540486534"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-58325-4_201","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}