arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0502354math.DScs.CC
收藏

On computational complexity of Siegel Julia sets

I. Binder, M. Braverman, M. Yampolsky

英文摘要:

It has been previously shown by two of the authors that some polynomial Julia sets are algorithmically impossible to draw with arbitrary magnification. On the other hand, for a large class of examples the problem of drawing a picture has polynomial complexity. In this paper we demonstrate the existence of computable quadratic Julia sets whose computational complexity is arbitrarily high.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑