{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:02:31Z","timestamp":1725483751339},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679011"},{"type":"electronic","value":"9783540446125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_11","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T13:28:20Z","timestamp":1178371700000},"page":"152-161","source":"Crossref","is-referenced-by-count":2,"title":["Measure Theoretic Completeness Notions for the Exponential Time Classes"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Ambos-Spies","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"K. Ambos-Spies and E. Mayordomo. Resource-bounded measure and randomness. In: A. Sorbi (ed.), Complexity, logic, and recursion theory, p. 1\u201347, Dekker, 1997.","DOI":"10.1201\/9780429187490-1"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"K. Ambos-Spies, E. Mayordomo and X. Zheng. A comparison of weak completeness notions. In: Proceedings of the 11th Ann. IEEE Conference on Computational Complexity, p. 171\u2013178, IEEE Computer Society Press, 1996.","DOI":"10.1109\/CCC.1996.507679"},{"key":"11_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/3-540-46541-3_35","volume-title":"STACS 2000","author":"K. Ambos-Spies","year":"2000","unstructured":"K. Ambos-Spies, W. Merkle, J. Reimann, and S.A. Terwijn. Almost complete sets. In: STACS 2000, LNCS 1770, p. 419\u2013430, Springer, 2000."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(96)89424-2","volume":"168","author":"K. Ambos-Spies","year":"1996","unstructured":"K. Ambos-Spies, H.-C. Neis and S.A. Terwijn. Genericity and measure for exponential time. Theoretical Computer Science, 168:3\u201319, 1996.","journal-title":"Theoretical Computer Science"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0304-3975(95)00260-X","volume":"172","author":"K. Ambos-Spies","year":"1997","unstructured":"K. Ambos-Spies, S.A. Terwijn and X. Zheng. Resource bounded randomness and weakly complete problems. Theoretical Computer Science, 172:195\u2013207, 1997.","journal-title":"Theoretical Computer Science"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"J.L. Balc\u00e1zar, J. D\u00edaz, and J. Gabarr\u00f3. Structural Complexity, volume I. Springer, 1995.","DOI":"10.1007\/978-3-642-79235-9"},{"key":"11_CR7","unstructured":"L. Berman. Polynomial reducibilities and complete sets. Ph.D. thesis, Cornell University, 1977."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"H. Buhrmann and L. Torenvliet. On the structure of complete sets. In: Proceedings of the 9th Ann. Structure in Complexity Conference, p. 118\u2013133, IEEE Computer Society Press, 1994.","DOI":"10.1109\/SCT.1994.315811"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"S. Homer. Structural properties for complete problems for exponential time. In: Complexity Theory Retrospective II (Hemaspaandra, L.A. et al., eds.), p. 135\u2013153, Springer, 1997.","DOI":"10.1007\/978-1-4612-1872-2_6"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1137\/S0097539792238133","volume":"24","author":"D.W. Juedes","year":"1995","unstructured":"D.W. Juedes and J.H. Lutz. The complexity and distribution of hard problems. SIAM Journal on Computing, 24:279\u2013295, 1995.","journal-title":"SIAM Journal on Computing"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(95)80016-6","volume":"143","author":"D.W. Juedes","year":"1995","unstructured":"D.W. Juedes and J.H. Lutz. Weak completeness in E and E2. Theoretical Computer Science, 143:149\u2013158, 1995.","journal-title":"Theoretical Computer Science"},{"key":"11_CR12","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. Journal of Computer and System Sciences, 44:220\u2013258, 1992.","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1137\/S0097539793249700","volume":"24","author":"J.H. Lutz","year":"1995","unstructured":"J.H. Lutz. Weakly hard problems. SIAM Journal on Computing 24:1170\u20131189, 1995.","journal-title":"SIAM Journal on Computing"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"J.H. Lutz. The quantitative structure of exponential time. In: Complexity Theory Retrospective II (Hemaspaandra, L.A. et al., eds.), p. 225\u2013260, Springer, 1997.","DOI":"10.1007\/978-1-4612-1872-2_10"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/0304-3975(94)00023-C","volume":"136","author":"E. Mayordomo","year":"1994","unstructured":"E. Mayordomo. Almost every set in exponential time is P-bi-immune. Theoretical Computer Science, 136:487\u2013506, 1994.","journal-title":"Theoretical Computer Science"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"K. Regan, D. Sivakumar and J.-Y. Cai. Pseudorandom generators, measure theory and natural proofs. In: Proceedings of the 36th Ann. IEEE Symposium an Foundations of Computer Science, p. 171\u2013178, IEEE Computer Society Press, 1995.","DOI":"10.1109\/SFCS.1995.492459"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T19:15:01Z","timestamp":1587496501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44612-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44612-5_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}