Computing complexity distances between algorithms. Romaguera, S., Sánchez-Pérez, E. A., & Valero, O. Kybernetika, 39(5):569-582, 2003.
Computing complexity distances between algorithms. [link]Link  Computing complexity distances between algorithms. [link]Paper  bibtex   
@article{journals/kybernetika/RomagueraSV03,
  added-at = {2015-11-25T00:00:00.000+0100},
  author = {Romaguera, Salvador and Sánchez-Pérez, E. A. and Valero, Oscar},
  biburl = {http://www.bibsonomy.org/bibtex/2d07332088e33d24c03c19cb55fba42ff/dblp},
  ee = {http://www.kybernetika.cz/content/2003/5/569},
  interhash = {911c4ffebff00d906250358b19b00b74},
  intrahash = {d07332088e33d24c03c19cb55fba42ff},
  journal = {Kybernetika},
  keywords = {dblp},
  number = 5,
  pages = {569-582},
  timestamp = {2015-11-26T11:33:58.000+0100},
  title = {Computing complexity distances between algorithms.},
  url = {http://dblp.uni-trier.de/db/journals/kybernetika/kybernetika39.html#RomagueraSV03},
  volume = 39,
  year = 2003
}

Downloads: 0