Hyperbolic Julia Sets are Poly-Time Computable. Braverman, M. In Brattka, V., Staiger, L., & Weihrauch, K., editors, Computability and Complexity in Analysis, volume 320, of Informatik Berichte, pages 15–27, August, 2004. FernUniversität in Hagen. Sixth International Workshop, CCA 2004, Lutherstadt Wittenberg, Germany, August 16–20, 2004
bibtex   
@INPROCEEDINGS{Bra04b,
  author = {Braverman, Mark},
  title = {Hyperbolic {J}ulia Sets are Poly-Time Computable},
  booktitle = {Computability and Complexity in Analysis},
  year = {2004},
  editor = {Brattka, Vasco and Staiger, Ludwig and Weihrauch, Klaus},
  volume = {320},
  series = {Informatik Berichte},
  pages = {15--27},
  month = aug,
  publisher = {FernUniversit\"at in Hagen},
  note = {Sixth International Workshop, CCA 2004, Lutherstadt Wittenberg, Germany,
	August 16--20, 2004}
}

Downloads: 0