{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:00:18Z","timestamp":1725552018737},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340218"},{"type":"electronic","value":"9783540340225"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11750321_4","type":"book-chapter","created":{"date-parts":[[2006,5,4]],"date-time":"2006-05-04T06:11:16Z","timestamp":1146723076000},"page":"61-67","source":"Crossref","is-referenced-by-count":2,"title":["Mitosis in Computational Complexity"],"prefix":"10.1007","author":[{"given":"Christian","family":"Gla\u00dfer","sequence":"first","affiliation":[]},{"given":"A.","family":"Pavan","sequence":"additional","affiliation":[]},{"given":"Alan L.","family":"Selman","sequence":"additional","affiliation":[]},{"given":"Liyu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Logic and Machines","author":"K. Ambos-Spies","year":"1984","unstructured":"Ambos-Spies, K.: P-mitotic sets. In: B\u00f6rger, E., Hasenj\u00e4ger, G., Roding, D. (eds.) Logic and Machines. LNCS, vol.\u00a0177, pp. 1\u201323. Springer, Heidelberg (1984)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01276436","volume":"2","author":"R. Beigel","year":"1992","unstructured":"Beigel, R., Feigenbaum, J.: On being incoherent without being very hard. Computational Complexity\u00a02, 1\u201317 (1992)","journal-title":"Computational Complexity"},{"issue":"5","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1137\/S0097539798334736","volume":"29","author":"H. Buhrman","year":"2000","unstructured":"Buhrman, H., Fortnow, L., van Melkebeek, D., Torenvliet, L.: Using autoreducibility to separate complexity classes. SIAM Journal on Computing\u00a029(5), 1497\u20131520 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1137\/S0097539795279724","volume":"27","author":"H. Buhrman","year":"1998","unstructured":"Buhrman, H., Hoene, A., Torenvliet, L.: Splittings, robustness, and structure of complete sets. SIAM Journal on Computing\u00a027, 637\u2013653 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Torenvliet, L.: On the structure of complete sets. In: Proceedings 9th Structure in Complexity Theory, pp. 118\u2013133 (1994)","DOI":"10.1109\/SCT.1994.315811"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the 30th International Symposium onMathematical Foundations of Computer Science","author":"C. Glasser","year":"2005","unstructured":"Glasser, C., Ogihara, M., Pavan, A., Selman, A., Zhang, L.: Autoreducibility, mitoticity, and immunity. In: Proceedings of the 30th International Symposium onMathematical Foundations of Computer Science. LNCS, vol.\u00a03618, Springer, Heidelberg (2005)"},{"key":"4_CR7","unstructured":"Glasser, C., Pavan, A., Selman, A., Zhang, L.: Redundancy in complete sets. Technical Report 05-068, Electronic Colloquium on Computational Complexity (2005)"},{"issue":"2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.2307\/2272056","volume":"38","author":"R. Ladner","year":"1973","unstructured":"Ladner, R.: Mitotic recursively enumerable sets. Journal of Symbolic Logic\u00a038(2), 199\u2013211 (1973)","journal-title":"Journal of Symbolic Logic"},{"issue":"3","key":"4_CR9","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/0220030","volume":"20","author":"M. Ogiwara","year":"1991","unstructured":"Ogiwara, M., Watanabe, O.: On polynomial-time bounded truth-table reducibility of NP sets to sparse sets. SIAM Journal of Computing\u00a020(3), 471\u2013483 (1991)","journal-title":"SIAM Journal of Computing"},{"key":"4_CR10","first-page":"814","volume":"192","author":"B. Trakhtenbrot","year":"1970","unstructured":"Trakhtenbrot, B.: On autoreducibility. Dokl. Akad. Nauk SSSR\u00a0192, (1970); Translation in Soviet Math. Dokl. 11, 814\u2013 817 (1970)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Yao, A.: Coherent functions and program checkers. In: Proceedings of the 22nd Annual Symposium on Theory of Computing, pp. 89\u201394 (1990)","DOI":"10.1145\/100216.100226"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11750321_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:56:37Z","timestamp":1619506597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11750321_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340218","9783540340225"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11750321_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}