Mark Braverman 2006 Nonlinearity 19 1383 doi:10.1088/0951-7715/19/6/009
Mark Braverman
Show affiliationsRecommended by R de la Llave
In this paper we prove that parabolic Julia sets of rational functions are locally computable in polynomial time.
02.10.De Algebraic structures and number theory
11B75 Other combinatorial number theory
05A05 Combinatorial choice problems (subsets, representatives, permutations)
11B39 Fibonacci and Lucas numbers and polynomials and generalizations
65D15 Algorithms for functional approximation
68W25 Approximation algorithms
37F50 Small divisors, rotation domains and linearization; Fatou and Julia sets
Issue 6 (June 2006)
Received 23 November 2005
Published 15 May 2006
Mark Braverman 2006 Nonlinearity 19 1383
Bryan Kelleher 2004 Class. Quantum Grav. 21 483
A van den Bos 1977 J. Phys. E: Sci. Instrum. 10 753
H C Lee 1996 J. Phys. A: Math. Gen. 29 393
R Abbott et al 2004 Class. Quantum Grav. 21 S915
B G O'Hare et al 1975 J. Phys. B: At. Mol. Phys. 8 2968
A L Cavalcanti de Oliveira and E R Bezerra de Mello 2004 Class. Quantum Grav. 21 1685
D Vokoun et al 2005 Smart Mater. Struct. 14 S261
H H Emsley 1943 Proc. Phys. Soc. 55 314
Birsen Yazici et al 2006 Inverse Problems 22 1705