{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T04:45:56Z","timestamp":1666413956622},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,4,16]],"date-time":"2020-04-16T00:00:00Z","timestamp":1586995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,16]],"date-time":"2020-04-16T00:00:00Z","timestamp":1586995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s10208-020-09457-w","type":"journal-article","created":{"date-parts":[[2020,4,16]],"date-time":"2020-04-16T18:04:45Z","timestamp":1587060285000},"page":"59-69","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Real Quadratic Julia Sets Can Have Arbitrarily High Complexity"],"prefix":"10.1007","volume":"21","author":[{"given":"Cristobal","family":"Rojas","sequence":"first","affiliation":[]},{"given":"Michael","family":"Yampolsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,16]]},"reference":[{"issue":"2","key":"9457_CR1","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s00220-006-1546-3","volume":"264","author":"I Binder","year":"2006","unstructured":"I.\u00a0Binder, M.\u00a0Braverman, and M.\u00a0Yampolsky, On computational complexity of Siegel Julia sets, Commun. Math. Phys. 264 (2006), no.\u00a02, 317\u2013334.","journal-title":"Commun. Math. Phys."},{"key":"9457_CR2","doi-asserted-by":"crossref","unstructured":"M.\u00a0Braverman, Computational complexity of Euclidean sets: Hyperbolic Julia sets are poly-time computable, Master\u2019s thesis, University of Toronto, 2004.","DOI":"10.1016\/j.entcs.2004.06.031"},{"key":"9457_CR3","unstructured":"M.\u00a0Braverman, Parabolic Julia sets are polynomial time computable, Nonlinearity 19(2006), no.\u00a0(6), 1383\u20131401."},{"key":"9457_CR4","doi-asserted-by":"crossref","unstructured":"M\u00a0Braverman and M.\u00a0Yampolsky, Computability of Julia sets, Algorithms and Computation in Mathematics, vol.\u00a023, Springer, 2008.","DOI":"10.17323\/1609-4514-2008-8-2-185-231"},{"key":"9457_CR5","doi-asserted-by":"crossref","unstructured":"A. Douady, Does a Julia set depend continuously on the polynomial?, Complex dynamical systems (Cincinnati, OH, 1994), Proc. Sympos. Appl. Math., vol.\u00a049, Amer. Math. Soc., Providence, RI, 1994, pp.\u00a091\u2013138.","DOI":"10.1090\/psapm\/049\/1315535"},{"key":"9457_CR6","doi-asserted-by":"publisher","first-page":"2441","DOI":"10.1017\/etds.2015.24","volume":"36","author":"A Dudko","year":"2016","unstructured":"A.\u00a0Dudko and M.\u00a0Yampolsky, Poly-time computability of the Feigenbaum Julia set, Ergodic Theory Dyn. Syst. 36 (2016), 2441\u20132462.","journal-title":"Ergodic th. and dynam. sys."},{"key":"9457_CR7","unstructured":"A.\u00a0Dudko and M.\u00a0Yampolsky, Almost all real quadratic Julia sets are poly-time, Found. Comput. Math. (2018), no.\u00a018, 1233\u20131243."},{"key":"9457_CR8","unstructured":"A.\u00a0Epstein, Towers of finite type complex analytic maps, Ph.D. thesis, CUNY, 1993."},{"key":"9457_CR9","unstructured":"J.\u00a0Milnor, Self-similarity and hairiness in the Mandelbrot set, Computers in Geometry and Topology (M\u00a0Tangora, ed.), Lect. Notes Pure Appl. Math., vol. 114, Marcel Dekker, 1989, pp.\u00a0211\u2013257."},{"key":"9457_CR10","unstructured":"J.\u00a0Milnor, Dynamics in one complex variable. Introductory lectures, 3rd ed., Princeton University Press, 2006."},{"key":"9457_CR11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.entcs.2004.06.041","volume":"120","author":"R Rettinger","year":"2005","unstructured":"R.\u00a0Rettinger, A fast algorithm for Julia sets of hyperbolic rational functions., Electr. Notes Theor. Comput. Sci. 120 (2005), 145\u2013157.","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"9457_CR12","doi-asserted-by":"crossref","unstructured":"A.\u00a0M. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proceedings, London Mathematical Society (1936), 230\u2013265.","DOI":"10.1112\/plms\/s2-42.1.230"},{"issue":"4","key":"9457_CR13","doi-asserted-by":"publisher","first-page":"533","DOI":"10.5802\/afst.1061","volume":"12","author":"M Yampolsky","year":"2003","unstructured":"M.\u00a0Yampolsky, Complex bounds revisited, Ann. Fac. Sci. Toulouse Math. 12 (2003), no.\u00a04, 533\u2013547.","journal-title":"Ann. Fac. Sci. Toulouse Math."}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-020-09457-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10208-020-09457-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-020-09457-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T14:21:41Z","timestamp":1666362101000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10208-020-09457-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,16]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["9457"],"URL":"https:\/\/doi.org\/10.1007\/s10208-020-09457-w","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,16]]},"assertion":[{"value":"22 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}