"Braverman and Yampolsky: Computability of Julia Sets - Algorithms and ..."

Arnaud Chéritat (2012)

> Home

Details and statistics

DOI: 10.1007/S10208-011-9111-7

access: closed

type: Journal Article

metadata version: 2023-10-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/focm/Cheritat12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/focm/Cheritat12
Arnaud Chéritat:
Braverman and Yampolsky: Computability of Julia Sets - Algorithms and Computations in Mathematics, Volume 23, Springer. Found. Comput. Math. 12(1): 123-137 (2012)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.