{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:36:45Z","timestamp":1743097005633,"version":"3.40.3"},"publisher-location":"Cham","reference-count":97,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030416713"},{"type":"electronic","value":"9783030416720"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-41672-0_1","type":"book-chapter","created":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T07:03:04Z","timestamp":1582182184000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["In Memoriam: Ker-I Ko (1950\u20132018)"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7345-2185","authenticated-orcid":false,"given":"Ding-Zhu","family":"Du","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1483-2783","authenticated-orcid":false,"given":"Jie","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,21]]},"reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/s10878-016-0067-z","volume":"34","author":"X Chen","year":"2017","unstructured":"Chen, X., et al.: Centralized and decentralized rumor blocking problems. J. Comb. Optim. 34(1), 314\u2013329 (2017)","journal-title":"J. Comb. Optim."},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2017.06.026","volume":"694","author":"W Li","year":"2017","unstructured":"Li, W., Liu, W., Chen, T., Qu, X., Fang, Q., Ko, K.-I.: Competitive profit maximization in social networks. Theor. Comput. Sci. 694, 1\u20139 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1505","DOI":"10.1007\/s10878-015-9838-1","volume":"31","author":"Y Ran","year":"2016","unstructured":"Ran, Y., Zhang, Z., Ko, K.-I., Liang, J.: An approximation algorithm for maximum weight budgeted connected set cover. J. Comb. Optim. 31(4), 1505\u20131517 (2016)","journal-title":"J. Comb. Optim."},{"issue":"3\u20134","key":"1_CR4","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.jco.2013.03.002","volume":"29","author":"K-I Ko","year":"2013","unstructured":"Ko, K.-I.: On the complexity of computing the Hausdorff distance. J. Complex. 29(3\u20134), 248\u2013262 (2013)","journal-title":"J. Complex."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.tcs.2012.10.004","volume":"469","author":"Y Fuxiang","year":"2013","unstructured":"Fuxiang, Y., Ko, K.-I.: On logarithmic-space computable real numbers. Theor. Comput. Sci. 469, 127\u2013133 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR6","first-page":"48","volume":"489\u2013490","author":"Y Fuxiang","year":"2013","unstructured":"Fuxiang, Y., Ko, K.-I.: On parallel complexity of analytic functions. Theor. Comput. Sci. 489\u2013490, 48\u201357 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"18","key":"1_CR7","first-page":"2495","volume":"16","author":"A Bauer","year":"2010","unstructured":"Bauer, A., Hertling, P., Ko, K.-I.: Computability and complexity in analysis. J. UCS 16(18), 2495 (2010)","journal-title":"J. UCS"},{"issue":"11","key":"1_CR8","doi-asserted-by":"publisher","first-page":"1529","DOI":"10.1089\/cmb.2008.0224","volume":"16","author":"Y Cheng","year":"2009","unstructured":"Cheng, Y., Ding-Zhu, D., Ko, K.-I., Lin, G.: On the parameterized complexity of pooling design. J. Comput. Biol. 16(11), 1529\u20131537 (2009)","journal-title":"J. Comput. Biol."},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.entcs.2008.03.012","volume":"202","author":"K-I Ko","year":"2008","unstructured":"Ko, K.-I., Fuxiang, Y.: On the complexity of convex hulls of subsets of the two-dimensional plane. Electr. Notes Theor. Comput. Sci. 202, 121\u2013135 (2008)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.tcs.2007.10.014","volume":"390","author":"Y Cheng","year":"2008","unstructured":"Cheng, Y., Ko, K.-I., Weili, W.: On the complexity of non-unique probe selection. Theor. Comput. Sci. 390(1), 120\u2013125 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.entcs.2006.08.022","volume":"167","author":"K-I Ko","year":"2007","unstructured":"Ko, K.-I., Fuxiang, Y.: Jordan curves with polynomial inverse moduli of continuity. Electr. Notes Theor. Comput. Sci. 167, 425\u2013447 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.jco.2006.05.007","volume":"23","author":"K-I Ko","year":"2007","unstructured":"Ko, K.-I., Fuxiang, Y.: On the complexity of computing the logarithm and square root functions on a complex domain. J. Complex. 23(1), 2\u201324 (2007)","journal-title":"J. Complex."},{"issue":"4\u20135","key":"1_CR13","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1002\/malq.200790001","volume":"53","author":"K-I Ko","year":"2007","unstructured":"Ko, K.-I., Weihrauch, K., Zheng, X.: Editorial: Math. Log. Quart. 4\u20135\/2007. Math. Log. Q. 53(4\u20135), 325 (2007)","journal-title":"Math. Log. Q."},{"issue":"1\u20133","key":"1_CR14","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.tcs.2007.04.020","volume":"381","author":"K-I Ko","year":"2007","unstructured":"Ko, K.-I., Fuxiang, Y.: Jordan curves with polynomial inverse moduli of continuity. Theor. Comput. Sci. 381(1\u20133), 148\u2013161 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"1_CR15","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1016\/j.jco.2006.10.001","volume":"22","author":"V Brattka","year":"2006","unstructured":"Brattka, V., Hertling, P., Ko, K.-I., Tsuiki, H.: Computability and complexity in analysis. J. Complex. 22(6), 728 (2006)","journal-title":"J. Complex."},{"issue":"6","key":"1_CR16","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/j.jco.2006.05.005","volume":"22","author":"Y Fuxiang","year":"2006","unstructured":"Fuxiang, Y., Chou, A.W., Ko, K.-I.: On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain. J. Complex. 22(6), 803\u2013817 (2006)","journal-title":"J. Complex."},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.entcs.2004.06.033","volume":"120","author":"AW Chou","year":"2005","unstructured":"Chou, A.W., Ko, K.-I.: On the complexity of finding paths in a two-dimensional domain II: piecewise straight-line paths. Electr. Notes Theor. Comput. Sci. 120, 45\u201357 (2005)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"1\u20133","key":"1_CR18","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.tcs.2004.11.016","volume":"337","author":"AW Chou","year":"2005","unstructured":"Chou, A.W., Ko, K.-I.: The computational complexity of distance functions of two-dimensional domains. Theor. Comput. Sci. 337(1\u20133), 360\u2013369 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"4\u20135","key":"1_CR19","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1002\/malq.200490000","volume":"50","author":"V Brattka","year":"2004","unstructured":"Brattka, V., Hertling, P., Ko, K.-I., Zhong, N.: Preface: MLQ - Math. Log. Quart. 4\u20135\/2004. Math. Log. Q. 50(4\u20135), 327\u2013328 (2004)","journal-title":"Math. Log. Q."},{"issue":"6","key":"1_CR20","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1002\/malq.200310120","volume":"50","author":"AW Chou","year":"2004","unstructured":"Chou, A.W., Ko, K.-I.: On the complexity of finding paths in a two-dimensional domain I: shortest paths. Math. Log. Q. 50(6), 551\u2013572 (2004)","journal-title":"Math. Log. Q."},{"issue":"1\u20133","key":"1_CR21","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.tcs.2004.08.013","volume":"329","author":"L Ruan","year":"2004","unstructured":"Ruan, L., Hongwei, D., Jia, X., Weili, W., Li, Y., Ko, K.-I.: A greedy approximation for minimum connected dominating sets. Theor. Comput. Sci. 329(1\u20133), 325\u2013330 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"1_CR22","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0304-3975(01)00056-1","volume":"284","author":"K-I Ko","year":"2002","unstructured":"Ko, K.-I., Nerode, A., Weihrauch, K.: Foreword. Theor. Comput. Sci. 284(2), 197 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"1_CR23","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0168-0072(97)00060-2","volume":"93","author":"K-I Ko","year":"1998","unstructured":"Ko, K.-I.: On the computability of fractal dimensions and hausdorff measure. Ann. Pure Appl. Logic 93(1\u20133), 195\u2013216 (1998)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2","key":"1_CR24","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1006\/jcom.1995.1011","volume":"11","author":"K-I Ko","year":"1995","unstructured":"Ko, K.-I.: Computational complexity of fixed points and intersection points. J. Complex. 11(2), 265\u2013292 (1995)","journal-title":"J. Complex."},{"issue":"3","key":"1_CR25","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF01279452","volume":"7","author":"K-I Ko","year":"1995","unstructured":"Ko, K.-I., Lin, C.-L.: On the longest circuit in an alterable digraph. J. Glob. Optim. 7(3), 279\u2013295 (1995)","journal-title":"J. Glob. Optim."},{"issue":"5","key":"1_CR26","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1137\/S009753979325456X","volume":"24","author":"AW Chou","year":"1995","unstructured":"Chou, A.W.: Computational complexity of two-dimensional regions. SIAM J. Comput. 24(5), 923\u2013947 (1995)","journal-title":"SIAM J. Comput."},{"issue":"1&2","key":"1_CR27","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0304-3975(94)00154-B","volume":"145","author":"K-I Ko","year":"1995","unstructured":"Ko, K.-I.: A polynomial-time computable curve whose interior has a nonrecursive measure. Theor. Comput. Sci. 145(1&2), 241\u2013270 (1995)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1_CR28","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/174644.174648","volume":"41","author":"P Orponen","year":"1994","unstructured":"Orponen, P., Ko, K.-I., Sch\u00f6ning, U., Watanabe, O.: Instance complexity. J. ACM 41(1), 96\u2013121 (1994)","journal-title":"J. ACM"},{"issue":"3","key":"1_CR29","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0168-0072(92)90028-X","volume":"58","author":"K-I Ko","year":"1992","unstructured":"Ko, K.-I.: On the computational complexity of integral equations. Ann. Pure Appl. Logic 58(3), 201\u2013228 (1992)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"3","key":"1_CR30","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0885-064X(92)90023-5","volume":"8","author":"D Ding-Zhu","year":"1992","unstructured":"Ding-Zhu, D., Ko, K.-I.: A note on best fractions of a computable real number. J. Complex. 8(3), 216\u2013229 (1992)","journal-title":"J. Complex."},{"key":"1_CR31","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01200064","volume":"1","author":"K-I Ko","year":"1991","unstructured":"Ko, K.-I., Tzeng, W.-G.: Three $$\\Sigma ^p_2$$-complete problems in computational learning theory. Comput. Complex. 1, 269\u2013310 (1991)","journal-title":"Comput. Complex."},{"issue":"2","key":"1_CR32","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0890-5401(91)90002-J","volume":"90","author":"K-I Ko","year":"1991","unstructured":"Ko, K.-I.: Separating the low and high hierarchies by oracles. Inf. Comput. 90(2), 156\u2013177 (1991)","journal-title":"Inf. Comput."},{"issue":"5","key":"1_CR33","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1137\/0220059","volume":"20","author":"K-I Ko","year":"1991","unstructured":"Ko, K.-I.: On the complexity of learning minimum time-bounded turing machines. SIAM J. Comput. 20(5), 962\u2013986 (1991)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1_CR34","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(91)90171-W","volume":"82","author":"K-I Ko","year":"1991","unstructured":"Ko, K.-I.: On adaptive versus nonadaptive bounded query machines. Theor. Comput. Sci. 82(1), 51\u201369 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR35","first-page":"229","volume":"24","author":"K-I Ko","year":"1990","unstructured":"Ko, K.-I.: A note on separating the relativized polynomial time hierarchy by immune sets. ITA 24, 229\u2013240 (1990)","journal-title":"ITA"},{"issue":"2","key":"1_CR36","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1145\/77600.77623","volume":"37","author":"K-I Ko","year":"1990","unstructured":"Ko, K.-I.: Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy. J. ACM 37(2), 415\u2013438 (1990)","journal-title":"J. ACM"},{"issue":"1","key":"1_CR37","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/0890-5401(89)90029-1","volume":"81","author":"K-I Ko","year":"1989","unstructured":"Ko, K.-I.: Distinguishing conjunctive and disjunctive reducibilities by sparse sets. Inf. Comput. 81(1), 62\u201387 (1989)","journal-title":"Inf. Comput."},{"issue":"2","key":"1_CR38","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1137\/0218027","volume":"18","author":"K-I Ko","year":"1989","unstructured":"Ko, K.-I.: Relativized polynomial time hierarchies having exactly k levels. SIAM J. Comput. 18(2), 392\u2013408 (1989)","journal-title":"SIAM J. Comput."},{"key":"1_CR39","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BF02006188","volume":"5","author":"D-Z Du","year":"1989","unstructured":"Du, D.-Z., Ko, K.-I.: On the complexity of an optimal routing tree problem. Acta Math. Appl. Sinica (Engl. Ser.) 5, 68\u201380 (1989)","journal-title":"Acta Math. Appl. Sinica (Engl. Ser.)"},{"key":"1_CR40","first-page":"70","volume":"2","author":"D-Z Du","year":"1989","unstructured":"Du, D.-Z., Ko, K.-I.: Complexity of continuous problems on convex functions. Syst. Sci. Math. 2, 70\u201379 (1989)","journal-title":"Syst. Sci. Math."},{"issue":"5","key":"1_CR41","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1137\/0217056","volume":"17","author":"RV Book","year":"1988","unstructured":"Book, R.V., Ko, K.-I.: On sets truth-table reducible to sparse sets. SIAM J. Comput. 17(5), 903\u2013919 (1988)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1_CR42","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/0401007","volume":"1","author":"K-I Ko","year":"1988","unstructured":"Ko, K.-I.: Searching for two objects by underweight feedback. SIAM J. Discrete Math. 1(1), 65\u201370 (1988)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"1_CR43","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0890-5401(87)90026-5","volume":"74","author":"A Marron","year":"1987","unstructured":"Marron, A., Ko, K.-I.: Identification of pattern languages from examples and queries. Inf. Comput. 74(2), 91\u2013112 (1987)","journal-title":"Inf. Comput."},{"key":"1_CR44","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/0608062","volume":"8","author":"D Du","year":"1987","unstructured":"Du, D., Ko, K.: Some completeness results on decision trees and group testing. SIAM J. Algebraic Discrete Methods 8, 762\u2013777 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1","key":"1_CR45","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0022-0000(87)90006-7","volume":"34","author":"K-I Ko","year":"1987","unstructured":"Ko, K.-I., Hua, C.-M.: A note on the two-variable pattern-finding problem. J. Comput. Syst. Sci. 34(1), 75\u201386 (1987)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR46","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0304-3975(87)90078-8","volume":"52","author":"K-I Ko","year":"1987","unstructured":"Ko, K.-I.: On helping by robust oracle machines. Theor. Comput. Sci. 52, 15\u201336 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR47","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/0304-3975(87)90139-3","volume":"54","author":"K-I Ko","year":"1987","unstructured":"Ko, K.-I.: Corrigenda: on the continued fraction representation of computable real numbers. Theor. Comput. Sci. 54, 341\u2013343 (1987)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"1_CR48","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0168-0072(86)90005-9","volume":"30","author":"K-I Ko","year":"1986","unstructured":"Ko, K.-I.: Approximation to measurable functions and its relation to probabilistic computation. Ann. Pure Appl. Logic 30(2), 173\u2013200 (1986)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"4","key":"1_CR49","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/0196-6774(86)90013-1","volume":"7","author":"K-I Ko","year":"1986","unstructured":"Ko, K.-I., Teng, S.-C.: On the number of queries necessary to identify a permutation. J. Algorithms 7(4), 449\u2013462 (1986)","journal-title":"J. Algorithms"},{"issue":"2","key":"1_CR50","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0885-064X(86)90014-2","volume":"2","author":"K-I Ko","year":"1986","unstructured":"Ko, K.-I.: On the computational complexity of best Chebyshev approximations. J. Complex. 2(2), 95\u2013120 (1986)","journal-title":"J. Complex."},{"issue":"3","key":"1_CR51","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0304-3975(86)90152-0","volume":"47","author":"K-I Ko","year":"1986","unstructured":"Ko, K.-I., Long, T.J., Ding-Zhu, D.: On one-way functions and polynomial-time isomorphisms. Theor. Comput. Sci. 47(3), 263\u2013276 (1986)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"1_CR52","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0304-3975(86)90154-4","volume":"47","author":"K-I Ko","year":"1986","unstructured":"Ko, K.-I.: On the continued fraction representation of computable real numbers. Theor. Comput. Sci. 47(3), 299\u2013313 (1986)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"1_CR53","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0304-3975(86)90081-2","volume":"48","author":"K-I Ko","year":"1986","unstructured":"Ko, K.-I.: On the notion of infinite pseudorandom sequences. Theor. Comput. Sci. 48(3), 9\u201333 (1986)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"1_CR54","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/0885-064X(85)90012-3","volume":"1","author":"K-I Ko","year":"1985","unstructured":"Ko, K.-I.: Continuous optimization problems and a polynomial hierarchy of real functions. J. Complex. 1(2), 210\u2013231 (1985)","journal-title":"J. Complex."},{"issue":"3","key":"1_CR55","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01699469","volume":"18","author":"K-I Ko","year":"1985","unstructured":"Ko, K.-I.: Nonlevelable sets and immune sets in the accepting density hierarchy in NP. Math. Syst. Theory 18(3), 189\u2013205 (1985)","journal-title":"Math. Syst. Theory"},{"issue":"1","key":"1_CR56","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/0214003","volume":"14","author":"K-I Ko","year":"1985","unstructured":"Ko, K.-I., Sch\u00f6ning, U.: On circuit-size complexity and the low hierarchy in NP. SIAM J. Comput. 14(1), 41\u201351 (1985)","journal-title":"SIAM J. Comput."},{"key":"1_CR57","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(85)90085-4","volume":"37","author":"K-I Ko","year":"1985","unstructured":"Ko, K.-I.: On some natural complete operators. Theor. Comput. Sci. 37, 1\u201330 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR58","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0304-3975(84)90129-4","volume":"31","author":"K-I Ko","year":"1984","unstructured":"Ko, K.-I.: Reducibilities on real numbers. Theor. Comput. Sci. 31, 101\u2013123 (1984)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"1_CR59","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0019-9958(83)80062-X","volume":"58","author":"K-I Ko","year":"1983","unstructured":"Ko, K.-I.: On the computational complexity of ordinary differential equations. Inf. Control 58(1\u20133), 157\u2013194 (1983)","journal-title":"Inf. Control"},{"issue":"2","key":"1_CR60","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(83)90013-2","volume":"26","author":"K-I Ko","year":"1983","unstructured":"Ko, K.-I.: On self-reducibility and weak p-selectivity. J. Comput. Syst. Sci. 26(2), 209\u2013221 (1983)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"1_CR61","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF01744572","volume":"16","author":"K-I Ko","year":"1983","unstructured":"Ko, K.-I.: On the definitions of some complexity classes of real numbers. Math. Syst. Theory 16(2), 95\u2013109 (1983)","journal-title":"Math. Syst. Theory"},{"issue":"1\/2","key":"1_CR62","first-page":"21","volume":"53","author":"K-I Ko","year":"1982","unstructured":"Ko, K.-I.: Some negative results on the computational complexity of total variation and differentiation. Inf. Control 53(1\/2), 21\u201331 (1982)","journal-title":"Inf. Control"},{"issue":"1","key":"1_CR63","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0020-0190(82)90139-9","volume":"14","author":"K-I Ko","year":"1982","unstructured":"Ko, K.-I.: Some observations on the probabilistic algorithms and NP-hard problems. Inf. Process. Lett. 14(1), 39\u201343 (1982)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"1_CR64","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0022-0000(82)90053-8","volume":"24","author":"K-I Ko","year":"1982","unstructured":"Ko, K.-I.: The maximum value problem and NP real numbers. J. Comput. Syst. Sci. 24(1), 15\u201335 (1982)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR65","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(82)80003-0","volume":"20","author":"K-I Ko","year":"1982","unstructured":"Ko, K.-I., Friedman, H.: Computational complexity of real functions. Theor. Comput. Sci. 20, 323\u2013352 (1982)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"1_CR66","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1137\/0210061","volume":"10","author":"K-I Ko","year":"1981","unstructured":"Ko, K.-I., Moore, D.J.: Completeness, approximation and density. SIAM J. Comput. 10(4), 787\u2013796 (1981)","journal-title":"SIAM J. Comput."},{"key":"1_CR67","unstructured":"Bauer, A., Hertling, P., Ko, K.-I.: CCA 2009 front matter - proceedings of the sixth international conference on computability and complexity in analysis. In: CCA (2009)"},{"key":"1_CR68","unstructured":"Bauer, A., Hertling, P., Ko, K.-I.: CCA 2009 preface - proceedings of the sixth international conference on computability and complexity in analysis. In: CCA (2009)"},{"key":"1_CR69","unstructured":"Yu, F., Chou, A.W., Ko, K.-I.: On the complexity of finding circumscribed rectangles for a two-dimensional domain. In: CCA, pp. 341\u2013355 (2005)"},{"key":"1_CR70","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/11533719_36","volume-title":"Computing and Combinatorics","author":"K-I Ko","year":"2005","unstructured":"Ko, K.-I., Yu, F.: On the complexity of computing the logarithm and square root functions on a complex domain. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 349\u2013358. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11533719_36"},{"key":"1_CR71","unstructured":"Ko, K.-I.: Fractals and complexity. In: CCA (1996)"},{"key":"1_CR72","unstructured":"Ko, K.-I., Weihrauch, K.: On the measure of two-dimensional regions with polynomial-time computables boundaries. In: Computational Complexity Conference, pp. 150\u2013159 (1996)"},{"key":"1_CR73","doi-asserted-by":"crossref","unstructured":"Chou, A.W., Ko, K.-I.: Some complexity issues on the simply connected regions of the two-dimensional plane. In: STOC, pp. 1\u201310 (1993)","DOI":"10.1145\/167088.167093"},{"key":"1_CR74","unstructured":"Ko, K.-I.: A note on the instance complexity of pseudorandom sets. In: Computational Complexity Conference, pp. 327\u2013337 (1992)"},{"key":"1_CR75","doi-asserted-by":"crossref","unstructured":"Ko, K.-I.: Integral equations, systems of quadratic equations, and exponential-time completeness (extended abstract). In: STOC, pp. 10\u201320 (1991)","DOI":"10.1145\/103418.103427"},{"key":"1_CR76","doi-asserted-by":"crossref","unstructured":"Ko, K.-I.: On the complexity of learning minimum time-bounded Turing machines. In: COLT, pp. 82\u201396 (1990)","DOI":"10.1016\/B978-1-55860-146-8.50009-6"},{"key":"1_CR77","doi-asserted-by":"crossref","unstructured":"Ko, K.-I., Marron, A., Tzeng, W.-G.: Learning string patterns and tree patterns from examples. In: ML, pp. 384\u2013391 (1990)","DOI":"10.1016\/B978-1-55860-141-3.50049-3"},{"key":"1_CR78","doi-asserted-by":"crossref","unstructured":"Ko, K.-I.: Computational complexity of roots of real functions (extended abstract). In: FOCS, pp. 204\u2013209 (1989)","DOI":"10.1109\/SFCS.1989.63479"},{"key":"1_CR79","doi-asserted-by":"crossref","unstructured":"Ko, K.-I.: Relativized polynomial time hierarchies having exactly K levels. In: Computational Complexity Conference (1988)","DOI":"10.1109\/SCT.1988.5284"},{"key":"1_CR80","doi-asserted-by":"crossref","unstructured":"Ko, K.-I.: Distinguishing bounded reducibilities by sparse sets. In: Computational Complexity Conference, pp. 181\u2013191 (1988)","DOI":"10.1109\/SCT.1988.5278"},{"key":"1_CR81","doi-asserted-by":"crossref","unstructured":"Ko, K.-I: Relativized polynominal time hierarchies having exactly K levels. In: STOC, pp. 245\u2013253 (1988)","DOI":"10.1145\/62212.62235"},{"key":"1_CR82","doi-asserted-by":"crossref","unstructured":"Book, R.V., Ko, K.-I.: On sets reducible to sparse sets. In: Computational Complexity Conference (1987)","DOI":"10.1109\/PSCT.1987.10319264"},{"key":"1_CR83","doi-asserted-by":"crossref","unstructured":"Ko, K.-I.: On helping by robust oracle machines. In: Computational Complexity Conference (1987)","DOI":"10.1016\/0304-3975(87)90078-8"},{"key":"1_CR84","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-16486-3_99","volume-title":"Structure in Complexity Theory","author":"K-I Ko","year":"1986","unstructured":"Ko, K.-I., Orponen, P., Sch\u00f6ning, U., Watanabe, O.: What is a hard instance of a computational problem? In: Selman, A.L. (ed.) Structure in Complexity Theory. LNCS, vol. 223, pp. 197\u2013217. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-16486-3_99"},{"key":"1_CR85","doi-asserted-by":"crossref","unstructured":"Ko, K.-I, Long, T.J., Du, D.-Z.: A note on one-way functions and polynomial-time isomorphisms (extended abstract). In: STOC, pp. 295\u2013303 (1986)","DOI":"10.1145\/12130.12160"},{"key":"1_CR86","first-page":"1","volume-title":"Studies in Complexity Theory","author":"K Ko","year":"1986","unstructured":"Ko, K.: Applying techniques of discrete complexity theory to numerical computation. In: Book, R. (ed.) Studies in Complexity Theory, pp. 1\u201362. Research Notes in Theoretical Computer Science, Pitman (1986)"},{"key":"1_CR87","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-94-009-2411-6_2","volume-title":"Combinatorics, Computing and Complexity","author":"K Ko","year":"1989","unstructured":"Ko, K.: Constructing oracles by lower bound techniques for circuits. In: Du, D., Hu, G. (eds.) Combinatorics, Computing and Complexity, pp. 30\u201376. Kluwer Academic Publishers and Science Press, Boston (1989)"},{"key":"1_CR88","unstructured":"Ko, K.: Polynomial-time computability in analysis. In: Ershov, Y.L., et al. (eds.) Handbook of Recursive Mathematics. Recursive Algebra, Analysis and Combinatorics, vol. 2, pp. 1271\u20131317 (1998)"},{"key":"1_CR89","doi-asserted-by":"crossref","unstructured":"Ko, K.: Computational complexity of fractals. In: Downey, R., et al. (eds.) Proceedings of the 7th and 8th Asian Logic Conferences, pp. 252\u2013269. World Scientific, Singapore (2003)","DOI":"10.1142\/9789812705815_0011"},{"key":"1_CR90","first-page":"219","volume-title":"Nonconvex Optimization and Its Applications","author":"Ker-I Ko","year":"1995","unstructured":"Ko, K., Lin, C.-L.: On the complexity of min-max optimization problems and their approximation. In: Du, D.-Z., Pardalos, P.M. (eds.) Minimax and Applications, pp. 219\u2013239. Kluwer (1995)"},{"key":"1_CR91","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1701-9","volume-title":"Design and Analysis of Approximation Algorithms","author":"D-Z Du","year":"2012","unstructured":"Du, D.-Z., Ko, K.-I., Hu, X.: Design and Analysis of Approximation Algorithms. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4614-1701-9"},{"key":"1_CR92","volume-title":"Design and Analysis of Approximation Algorithms","author":"D-Z Du","year":"2011","unstructured":"Du, D.-Z., Ko, K., Hu, X.: Design and Analysis of Approximation Algorithms. Higher Education Press, Beijing (2011). (in Chinese)"},{"key":"1_CR93","volume-title":"Introduction to Computational Complexity","author":"D-Z Du","year":"2002","unstructured":"Du, D.-Z., Ko, K., Wang, J.: Introduction to Computational Complexity. Higher Education Press, Beijing (2002). (in Chinese)"},{"key":"1_CR94","doi-asserted-by":"publisher","DOI":"10.1002\/0471224642","volume-title":"Problem Solving in Automata, Languages and Complexity","author":"D-Z Du","year":"2001","unstructured":"Du, D.-Z., Ko, K.: Problem Solving in Automata, Languages and Complexity. Wiley, New York (2001)"},{"key":"1_CR95","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032916","volume-title":"Theory of Computational Complexity","author":"D-Z Du","year":"2000","unstructured":"Du, D.-Z., Ko, K.: Theory of Computational Complexity. Wiley, New York (2000)"},{"volume-title":"Advances in Algorithms, Languages, and Complexity","year":"1997","key":"1_CR96","unstructured":"Du, D.-Z., Ko, K. (eds.): Advances in Algorithms, Languages, and Complexity. Kluwer, Dordrecht (1997)"},{"key":"1_CR97","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-6802-1_3","volume-title":"Computational Complexity of Real Functions","author":"K Ko","year":"1991","unstructured":"Ko, K.: Computational Complexity of Real Functions. Birkhauser Boston, Boston (1991)"}],"container-title":["Lecture Notes in Computer Science","Complexity and Approximation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-41672-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T21:19:57Z","timestamp":1722460797000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-41672-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030416713","9783030416720"],"references-count":97,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-41672-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"21 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}