Projects
Reading
People
Chat
SU\G
(đž)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
On computational complexity of Cremer Julia sets
Artem Dudko
,
Michael Yampolsky
Type:
Preprint
Publication Date:
2019-07-25
Citations:
2
View Publication
Share
Locations
arXiv (Cornell University) -
View
Similar Works
Action
Title
Year
Authors
+
PDF
Chat
On computational complexity of Cremer Julia sets
2020
Artem Dudko
Michael Yampolsky
+
On computational complexity of Cremer Julia sets
2019
Artem Dudko
Michael Yampolsky
+
Computability and Complexity of Julia Sets
2014
Kota Hiratsuka
Yuzuru Sato
Zin Arai
+
PDF
Chat
Braverman and Yampolsky: Computability of Julia Sets
2011
Arnaud Chéritat
+
On the size of Julia sets
1994
A. Hinkkanen
+
Cayleyâs problem and Julia sets
1984
HeinzâOtto Peitgen
Dietmar Saupe
Fritz von Haeseler
+
A Fast Algorithm for Julia Sets of Hyperbolic Rational Functions
2005
RettingerRobert
+
Computability versus Topological Properties of Julia Sets
2009
+
Almost polynomial Complexity for Zero-dimensional Grbner Bases
2005
Amir Hashemi
Daniel Lazard
+
On the Julia set of Königs rootfinding algorithms
2013
Gerardo Honorato
+
DIOPHANTINE PROPERTIES OF JULIA SETS
1986
Pierre Moussa
+
Complexity of the BollobĂĄs-Riordan Polynomial
2008
Markus BlÀser
Holger Dell
Johann A. Makowsky
+
Topological complexity of Julia sets
1997
Jianyong Qiao
+
Julia Sets
1993
Michael F. Barnsley
+
Julia sets
1989
Linda Keen
+
Julia sets
1984
+
On the algebraic complexity of rational iteration procedures
1991
Walter BĂ€ur
+
Computational Complexity of Euclidean Sets: Hyperbolic Julia Sets are Poly-Time Computable
2004
Mark Braverman
+
Complexity Results for Fourier-Motzkin Elimination
2018
Delaram Talaashrafi
+
Properties of the Julia Set
1991
Alan F. Beardon
Works That Cite This (2)
Action
Title
Year
Authors
+
PDF
Chat
A survey on the hypertranscendence of the solutions of the Schröder's, Böttcher's and Abel's equations
2021
Gwladys Fernandes
+
A Survey on the Hypertranscendence of the Solutions of the Schröderâs, Böttcherâs and Abelâs Equations
2021
Gwladys Fernandes
Works Cited by This (6)
Action
Title
Year
Authors
+
PDF
Chat
Computability of Julia Sets
2008
Mark Braverman
Michael Yampolsky
+
SystÚmes dynamiques holomorphes : explosion de points périodiques paraboliques
1989
Pierre Lavaurs
+
Dynamics in one complex variable
2000
John Milnor
+
Non-computable Julia sets
2005
Mark Braverman
Michael Yampolsky
+
PDF
Chat
Constructing Locally Connected Non-Computable Julia Sets
2009
Mark Braverman
Michael Yampolsky
+
PDF
Chat
Filled Julia Sets with Empty Interior Are Computable
2006
Ilia Binder
Mark Braverman
Michael Yampolsky