Publications

@article{JCR5,

title = {Application of formal languages in the polynomial transformations of instances between NP-complete problems},

author = {Jorge A. Ruiz-Vanoye and Joaquín Pérez-Ortega and Rodolfo A. Pazos R. and Ocotlán Díaz-Parra and Hector J. Fraire-Huacuja and Juan Frausto-Solis and Gerardo Reyes-Salgado and Laura Cruz-Reyes },

url = {http://link.springer.com/article/10.1631/jzus.C1200349},

doi = {10.1631/jzus.C1200349},

issn = {1869-196X},

year  = {2013},

date = {2013-02-07},

journal = {Journal of Zhejiang University-SCIENCE C (Computers & Electronics)},

volume = {14},

number = {8},

pages = {623-633},

abstract = {We propose the usage of formal languages for expressing instances of NP-complete problems for their application in polynomial transformations. The proposed approach, which consists of using formal language theory for polynomial transformations, is more robust, more practical, and faster to apply to real problems than the theory of polynomial transformations. In this paper we propose a methodology for transforming instances between NP-complete problems, which differs from Garey and Johnson’s. Unlike most transformations which are used for proving that a problem is NP-complete based on the NP-completeness of another problem, the proposed approach is intended for extrapolating some known characteristics, phenomena, or behaviors from a problem A to another problem B. This extrapolation could be useful for predicting the performance of an algorithm for solving B based on its known performance for problem A, or for taking an algorithm that solves A and adapting it to solve B.},

keywords = {Papers in the Science Citation Index Expanded, polynomial transformations},

pubstate = {published},

tppubtype = {article}

}

@article{JCR7,

title = {Survey of Polynomial Transformations between NP-Complete problems},

author = {Jorge A. Ruiz-Vanoye and Joaquín Pérez-Ortega and Rodolfo A. Pazos R. and Ocotlán Díaz-Parra and Juan Frausto-Solís and Hector J. Fraire-Huacuja and Laura Cruz-Reyes and José A. Martínez-Flores},

url = {http://dx.doi.org/doi:10.1016/j.cam.2011.02.018},

doi = {10.1016/j.cam.2011.02.018},

issn = {0377-0427},

year  = {2011},

date = {2011-02-07},

journal = {Journal of Computational and Applied Mathematics},

volume = {235},

number = {16},

pages = {4851-4865},

abstract = {This paper aims at being a guide to understand polynomial transformations and polynomial reductions between NP-complete problems by presenting the methodologies for polynomial reductions/transformations and the differences between reductions and transformations. To this end the article shows examples of polynomial reductions/transformations and the restrictions to reduce/transform between NP-complete problems. Finally, this paper includes a digraph with the historical reductions/transformations between instances of NP-complete problems and introduces the term family of polynomial transformations.},

keywords = {Papers in the Science Citation Index Expanded, polynomial transformations},

pubstate = {published},

tppubtype = {article}

}