◍wovepaper
SearchResearchersInstitutions
Sign in
math.DSJun 22, 2005
22
citations (OpenAlex)
authors
  • Mark Braverman
institutions
  • University of Toronto
arXiv abstractPDF
paper

Parabolic Julia Sets are Polynomial Time Computable

arXiv:math/0505036 · doi:10.1088/0951-7715/19/6/009

Abstract

In this paper we prove that parabolic Julia sets of rational functions are locally computable in polynomial time.

Cited by in corpus (3)

  • Computability and analysis: the legacy of Alan Turing
  • Unveiling the Fractal Structure of Julia Sets with Lagrangian Descriptors
  • Poly-time Computability of the Feigenbaum Julia set
◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.