{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:10:52Z","timestamp":1725567052521},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_36","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:34:13Z","timestamp":1127813653000},"page":"349-358","source":"Crossref","is-referenced-by-count":3,"title":["On the Complexity of Computing the Logarithm and Square Root Functions on a Complex Domain"],"prefix":"10.1007","author":[{"given":"Ker-I","family":"Ko","sequence":"first","affiliation":[]},{"given":"Fuxiang","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"17","volume-title":"Proceedings of the 6th Workshop on Computability and Complexity in Analysis 2004","author":"M. Braverman","year":"2005","unstructured":"Braverman, M.: Hyperbolic Julia sets are poly-time computable. In: Proceedings of the 6th Workshop on Computability and Complexity in Analysis 2004. Electronic Notes in Theoretical Computer Science, vol.\u00a0120, pp. 17\u201330. Elsevier, Amsterdam (2005)"},{"key":"36_CR2","unstructured":"Braverman, M., Yampolsky, M.: Non-computable julia sets. CoRR, math.DS\/0406416 (2004)"},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1137\/S009753979325456X","volume":"24","author":"W. Chou","year":"1995","unstructured":"Chou, W., Ko, K.-I.: Computational complexity of two-dimensional regions. SIAM J. Comput.\u00a024, 923\u2013947 (1995)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"36_CR4","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1002\/malq.200310120","volume":"50","author":"W. Chou","year":"2004","unstructured":"Chou, W., Ko, K.-I.: On the complexity of finding paths in a two-dimensional domain I: Shortest paths. Mathematical Logic Quarterly\u00a050(6), 551\u2013572 (2004)","journal-title":"Mathematical Logic Quarterly"},{"key":"36_CR5","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"45","volume-title":"Proceedings of the 6th Workshop on Computability and Complexity in Analysis 2004","author":"W. Chou","year":"2005","unstructured":"Chou, W., Ko, K.-I.: On the complexity of finding paths in a two-dimensional domain II: Picewise straight-line paths. In: Proceedings of the 6th Workshop on Computability and Complexity in Analysis 2004. Electronic Notes in Theoretical Computer Science, vol.\u00a0120, pp. 45\u201357. Elsevier, Amsterdam (2005)"},{"key":"36_CR6","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.-I.: Theory of Computational Complexity. John Wiley & Sons, New York (2000)"},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1006\/jcss.1995.1036","volume":"50","author":"F. Green","year":"1995","unstructured":"Green, F., K\u00f6bler, J., Regan, K., Schwentick, T., Tor\u00e1n, J.: The power of the middle bit of a #P function. Journal of Computer and System Sciences\u00a050, 456\u2013467 (1995)","journal-title":"Journal of Computer and System Sciences"},{"key":"36_CR8","volume-title":"Applied and Computational Complex Analysis","author":"P. Herici","year":"1974","unstructured":"Herici, P.: Applied and Computational Complex Analysis, vol.\u00a01-3. John Wiley & Sons, New York (1974)"},{"key":"36_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-6802-1","volume-title":"Complexity Theory of Real Functions","author":"K.-I. Ko","year":"1991","unstructured":"Ko, K.-I.: Complexity Theory of Real Functions. Birkh\u00e4user, Basel (1991)"},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1142\/9789812705815_0011","volume-title":"Proceedings of the 7th and 8th Asian Logic Conferences","author":"K.-I. Ko","year":"2003","unstructured":"Ko, K.-I.: Computational complexity of fractals. In: Proceedings of the 7th and 8th Asian Logic Conferences, pp. 252\u2013269. World Scientific, Singapore (2003)"},{"key":"36_CR11","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. Theoretic Computer Science\u00a020, 323\u2013352 (1982)","journal-title":"Theoretic Computer Science"},{"key":"36_CR12","series-title":"Perspectives in Mathematical Logic","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21717-7","volume-title":"Computability in Analysis and Physics","author":"M.B. Pour-El","year":"1989","unstructured":"Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Perspectives in Mathematical Logic. Springer, Berlin (1989)"},{"key":"36_CR13","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"145","volume-title":"Proceedings of the 6th Workshop on Computability and Complexity in Analysis 2004","author":"R. Rettinger","year":"2005","unstructured":"Rettinger, R.: A fast algorithm for Julia sets of hyperbolic rational functions. In: Proceedings of the 6th Workshop on Computability and Complexity in Analysis 2004. Electronic Notes in Theoretical Computer Science, vol.\u00a0120, pp. 145\u2013157. Elsevier, Amsterdam (2005)"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Rettinger, R., Weihrauch, K.: The computational complexity of some julia sets. In: The Thirty-Fifth Annual ACM Symposium on Theory of Computing (STOC), pp. 177\u2013185 (2003)","DOI":"10.1145\/780542.780570"},{"key":"36_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T03:14:38Z","timestamp":1553138078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11533719_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}