The computational complexity of some Julia sets. Rettinger, R. & Weihrauch, K. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 177–185, New York, 2003. ACM Press. San Diego, California, USA, June 9–11, 2003
bibtex   
@INPROCEEDINGS{RW03,
  author = {Rettinger, Robert and Weihrauch, Klaus},
  title = {The computational complexity of some {J}ulia sets},
  booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing},
  year = {2003},
  editor = {Goemans, Michel X.},
  pages = {177--185},
  address = {New York},
  publisher = {ACM Press},
  note = {San Diego, California, USA, June 9--11, 2003},
  keywords = {bib,cca,thi1}
}
Downloads: 0