{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:26:45Z","timestamp":1725496005429},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770497"},{"type":"electronic","value":"9783540770503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-77050-3_12","type":"book-chapter","created":{"date-parts":[[2007,11,26]],"date-time":"2007-11-26T08:39:22Z","timestamp":1196066362000},"page":"146-157","source":"Crossref","is-referenced-by-count":2,"title":["Non-mitotic Sets"],"prefix":"10.1007","author":[{"given":"Christian","family":"Gla\u00dfer","sequence":"first","affiliation":[]},{"given":"Alan L.","family":"Selman","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Travers","sequence":"additional","affiliation":[]},{"given":"Liyu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","first-page":"139","volume-title":"IEEE Conference on Computational Complexity","author":"M. Agrawal","year":"2002","unstructured":"Agrawal, M.: Pseudo-random generators and structure of complete degrees. In: IEEE Conference on Computational Complexity, pp. 139\u2013147. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-13331-3_30","volume-title":"Logic and Machines: Decision Problems and Complexity","author":"K. Ambos-Spies","year":"1984","unstructured":"Ambos-Spies, K.: P-mitotic sets. In: B\u00f6rger, E., R\u00f6dding, D., Hasenjaeger, G. (eds.) Logic and Machines: Decision Problems and Complexity. LNCS, vol.\u00a0171, pp. 1\u201323. Springer, Heidelberg (1984)"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0304-3975(87)90053-3","volume":"51","author":"K. Ambos-Spies","year":"1987","unstructured":"Ambos-Spies, K., Fleischhack, H., Huwig, H.: Diagonalizations over polynomial time computable sets. Theoretical Computer Science\u00a051, 177\u2013204 (1987)","journal-title":"Theoretical Computer Science"},{"key":"12_CR4","unstructured":"Beigel, R.: Query-Limited Reducibilities. PhD thesis, Stanford University (1987)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/0022-0000(91)90040-C","volume":"42","author":"R. Beigel","year":"1991","unstructured":"Beigel, R.: Relativized counting classes: Relations among thresholds, parity, mods. Journal of Computer and System Sciences\u00a042, 76\u201396 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR6","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"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/0206023","volume":"6","author":"L. Berman","year":"1977","unstructured":"Berman, L., Hartmanis, J.: On isomorphism and density of NP and other complete sets. SIAM Journal on Computing\u00a06, 305\u2013322 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR8","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":"12_CR9","first-page":"193","volume-title":"Proceedings of the Tenth Annual IEEE Conference on Computational Complexity","author":"J. Balcazar","year":"1995","unstructured":"Balcazar, J., Mayordomo, E.: A note on genericty and bi-immunity. In: Proceedings of the Tenth Annual IEEE Conference on Computational Complexity, pp. 193\u2013196. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1006\/jcss.1996.0062","volume":"53","author":"H. Buhrman","year":"1996","unstructured":"Buhrman, H., Torenvliet, L.: P-selective self-reducible sets: A new characterization of P. Journal of Computer and System Sciences\u00a053, 210\u2013217 (1996)","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR11","unstructured":"Boneh, D., Venkatesan, R.: Rounding in lattices and its cryptographic applications. In: SODA, pp. 675\u2013681 (1997)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/11672142_36","volume-title":"STACS 2006","author":"C. Gla\u00dfer","year":"2006","unstructured":"Gla\u00dfer, C., Pavan, A., Selman, A.L., Zhang, L.: Redundancy in complete sets. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 444\u2013454. Springer, Heidelberg (2006)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Homer, S.: Structural properties of nondeterministic complete sets. In: Structure in Complexity Theory Conference, pp. 3\u201310 (1990)","DOI":"10.1109\/SCT.1990.113949"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-1-4612-1872-2_6","volume-title":"Complexity Theory Retrospective II","author":"S. Homer","year":"1997","unstructured":"Homer, S.: Structural properties of complete problems for exponential time. In: Selman, A.L., Hemaspaandra, L.A. (eds.) Complexity Theory Retrospective II, pp. 135\u2013153. Springer, New York (1997)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Hitchcock, J., Pavan, A.: Comparing reductions to NP-complete sets. Technical Report TR06-039, Electronic Colloquium on Computational Complexity (2006)","DOI":"10.1007\/11786986_41"},{"issue":"2","key":"12_CR16","doi-asserted-by":"publisher","first-page":"199","DOI":"10.2307\/2272056","volume":"38","author":"R.E. Ladner","year":"1973","unstructured":"Ladner, R.E.: Mitotic recursively enumerable sets. Journal of Symbolic Logic\u00a038(2), 199\u2013211 (1973)","journal-title":"Journal of Symbolic Logic"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","volume":"1","author":"R.E. Ladner","year":"1975","unstructured":"Ladner, R.E., Lynch, N.A., Selman, A.L.: A comparison of polynomial time reducibilities. Theoretical Computer Science\u00a01, 103\u2013123 (1975)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1137\/S0097539701387039","volume":"31","author":"A. Pavan","year":"2002","unstructured":"Pavan, A., Selman, A.L.: Separation of NP-completeness notions. SIAM Journal on Computing\u00a031(3), 906\u2013918 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF01744288","volume":"13","author":"A.L. Selman","year":"1979","unstructured":"Selman, A.L.: P-selective sets, tally languages, and the behavior of polynomial-time reducibilities on NP. Mathematical Systems Theory\u00a013, 55\u201365 (1979)","journal-title":"Mathematical Systems Theory"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0304-3975(82)90039-1","volume":"19","author":"A.L. Selman","year":"1982","unstructured":"Selman, A.L.: Reductions on NP and p-selective sets. Theoretical Computer Science\u00a019, 287\u2013304 (1982)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77050-3_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T22:48:30Z","timestamp":1684104510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77050-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540770497","9783540770503"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77050-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}