{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:06Z","timestamp":1725664986766},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631651"},{"type":"electronic","value":"9783540691945"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63165-8_176","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:10:39Z","timestamp":1330297839000},"page":"188-194","source":"Crossref","is-referenced-by-count":0,"title":["Results on resource-bounded measure"],"prefix":"10.1007","author":[{"given":"Harry","family":"Buhrman","sequence":"first","affiliation":[]},{"given":"Stephen","family":"Fenner","sequence":"additional","affiliation":[]},{"given":"Lance","family":"Fortnow","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"K. Ambos-Spies, E. Mayordomo, and Xizhong Zheng. A comparison of weak completeness notions. In Proeceedings of Eleventh Annual Conference on Computational Complexity, pages 171\u2013178, 1996.","DOI":"10.1109\/CCC.1996.507679"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF01275486","volume":"3","author":"L. Babai","year":"1993","unstructured":"L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential simulations unless EXPTIME has publishable proofs. Computational Complexity, 3:307\u2013318, 1993.","journal-title":"Computational Complexity"},{"issue":"2","key":"18_CR3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0890-5401(89)90053-9","volume":"82","author":"L. Babai","year":"1989","unstructured":"L\u00e1szl\u00f3 Babai and Shlomo Moran. Proving properties of interactive proofs by a generalized counting technique. Information and Computation, 82(2):185\u2013197, August 1989.","journal-title":"Information and Computation"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Buhrman and Torenvliet. On the cutting edge of relativization: The resource bounded injury method. In Annual International Colloquium on Automata, Languages and Programming, pages 263\u2013273, 1994.","DOI":"10.1007\/3-540-58201-0_74"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"S. Fenner and L. Fortnow. Beyond P NP =NEXP. In STACS 95, volume 900 of Lecture Notes in Computer Science, pages 619\u2013627. Springer, 1995.","DOI":"10.1007\/3-540-59042-0_110"},{"issue":"1\u20132","key":"18_CR6","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0304-3975(95)00189-1","volume":"164","author":"J. Lutz","year":"1996","unstructured":"J. Lutz and E. Mayordomo. Cook versus Karp-Levin: Separating completeness notions if NP is not small. Theoretical Computer Science, 164(1\u20132):141\u2013163, 1996.","journal-title":"Theoretical Computer Science"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"J. Lutz. Resource-Bounded Category and Measure in Exponential Complexity Classes. PhD thesis, Department of Mathematics, California Institute of Technology, 1987.","DOI":"10.1109\/PSCT.1987.10319257"},{"issue":"6","key":"18_CR8","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1137\/0219076","volume":"19","author":"J. Lutz","year":"1990","unstructured":"J. Lutz. Category and measure in complexity classes. SIAM J. Comput., 19(6):1100\u20131131, December 1990.","journal-title":"SIAM J. Comput."},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/0022-0000(92)90020-J","volume":"44","author":"J. Lutz","year":"1992","unstructured":"J. Lutz. Almost everywhere high nonuniform complexity. J. Computer and System Sciences, 44:220\u2013258, 1992.","journal-title":"J. Computer and System Sciences"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"J. Lutz. Observations on measure and lowness for \u0394 2 P . In STACS 96, volume 1046 of Lecture Notes in Computer Science, pages 87\u201398. Springer, 1996.","DOI":"10.1007\/3-540-60922-9_8"},{"issue":"2","key":"18_CR11","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(2):487\u2013506, 1994.","journal-title":"Theoretical Computer Science"},{"key":"18_CR12","unstructured":"E. Mayordomo. Contributions to the study of resource-bounded measure. PhD thesis, Universit\u00e4t Polit\u00e8cnica de Catalunya, 1994."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"K. Regan, D. Sivakumar, and J. Cai. Pseudorandom generators, measure theory, and natural proofs. In 36th Annual Symposium on Foundations of Computer Science, pages 26\u201335, 1995.","DOI":"10.1109\/SFCS.1995.492459"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63165-8_176.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T18:07:21Z","timestamp":1713636441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63165-8_176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631651","9783540691945"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-63165-8_176","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}