{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:38:53Z","timestamp":1729651133021,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE Comput. Soc. Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sct.1995.514870","type":"proceedings-article","created":{"date-parts":[[2002,11,19]],"date-time":"2002-11-19T16:11:47Z","timestamp":1037722307000},"page":"324-330","source":"Crossref","is-referenced-by-count":2,"title":["A small span theorem for P\/Poly-Turing reductions"],"prefix":"10.1109","author":[{"given":"J.H.","family":"Lutz","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref9a","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792238133"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)80030-D"},{"year":"0","key":"ref11"},{"key":"ref12a","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1994.315808"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(92)90020-J"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792237498"},{"journal-title":"Proceedings of the Ninth Structure in Complexity Theory Conference","first-page":"146","year":"1994","key":"ref12b"},{"journal-title":"Proc IEEE Symposium on Foundations of Computer Science","first-page":"177","year":"1993","key":"ref9b"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00023-C"},{"journal-title":"Contributions to the Study of Resource-bounded Measure","year":"1994","author":"mayordomo","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1979.29"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195134"},{"journal-title":"Probability and Measure","year":"1986","author":"billingsley","key":"ref4"},{"key":"ref3","first-page":"369","article-title":"Resource bounded randomness and weakly complete problems","author":"ambos-spies","year":"1994","journal-title":"Proc Fifth Ann Int l Symp Algorithms and Computation"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9440-2","author":"halmos","year":"1950","journal-title":"Measure Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60084-1_91"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-59042-0_59"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206322"},{"key":"ref2","article-title":"Genericity and measure for exponential time","author":"ambos-spies","year":"1994","journal-title":"Proc 10th Symp Math Found Comput Sci"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.2307\/2274958","article-title":"Reachability is harder for directed than for undirected graphs","volume":"55","author":"ajtai","year":"1990","journal-title":"Journal of Symbolic Logic"},{"year":"0","key":"ref20"},{"journal-title":"Proceedings of the Eleventh Symposium on Theoretical Aspects of Computer Science","first-page":"415","year":"1994","key":"ref14b"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3149.3158"},{"key":"ref14a","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00189-1"}],"event":{"name":"Structure in Complexity Theory. Tenth Annual IEEE Conference","acronym":"SCT-95","location":"Minneapolis, MN, USA"},"container-title":["Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx3\/3938\/11407\/00514870.pdf?arnumber=514870","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T11:06:11Z","timestamp":1497524771000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/514870\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/sct.1995.514870","relation":{},"subject":[]}}