Computing complexity distances between algorithms. Romaguera, S., Sánchez-Pérez, E. A., & Valero, O. Kybernetika, 39(5):569-582, 2003. 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
{"_id":"cCw34hzndS5djyNcT","bibbaseid":"romaguera-snchezprez-valero-computingcomplexitydistancesbetweenalgorithms-2003","downloads":0,"creationDate":"2015-12-10T07:18:38.669Z","title":"Computing complexity distances between algorithms.","author_short":["Romaguera, S.","Sánchez-Pérez, E. A.","Valero, O."],"year":2003,"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Erzin E.?items=1000","bibdata":{"bibtype":"article","type":"article","added-at":"2015-11-25T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Romaguera"],"firstnames":["Salvador"],"suffixes":[]},{"propositions":[],"lastnames":["Sánchez-Pérez"],"firstnames":["E.","A."],"suffixes":[]},{"propositions":[],"lastnames":["Valero"],"firstnames":["Oscar"],"suffixes":[]}],"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","bibtex":"@article{journals/kybernetika/RomagueraSV03,\n added-at = {2015-11-25T00:00:00.000+0100},\n author = {Romaguera, Salvador and Sánchez-Pérez, E. A. and Valero, Oscar},\n biburl = {http://www.bibsonomy.org/bibtex/2d07332088e33d24c03c19cb55fba42ff/dblp},\n ee = {http://www.kybernetika.cz/content/2003/5/569},\n interhash = {911c4ffebff00d906250358b19b00b74},\n intrahash = {d07332088e33d24c03c19cb55fba42ff},\n journal = {Kybernetika},\n keywords = {dblp},\n number = 5,\n pages = {569-582},\n timestamp = {2015-11-26T11:33:58.000+0100},\n title = {Computing complexity distances between algorithms.},\n url = {http://dblp.uni-trier.de/db/journals/kybernetika/kybernetika39.html#RomagueraSV03},\n volume = 39,\n year = 2003\n}\n\n","author_short":["Romaguera, S.","Sánchez-Pérez, E. A.","Valero, O."],"key":"journals/kybernetika/RomagueraSV03","id":"journals/kybernetika/RomagueraSV03","bibbaseid":"romaguera-snchezprez-valero-computingcomplexitydistancesbetweenalgorithms-2003","role":"author","urls":{"Link":"http://www.kybernetika.cz/content/2003/5/569","Paper":"http://dblp.uni-trier.de/db/journals/kybernetika/kybernetika39.html#RomagueraSV03"},"keyword":["dblp"],"downloads":0},"search_terms":["computing","complexity","distances","between","algorithms","romaguera","sánchez-pérez","valero"],"keywords":["dblp"],"authorIDs":[],"dataSources":["ErMZWQY9pNBp9sg9u"]}