Application of formal languages in polynomial transformations of instances between NP-complete problems
- First Online:
- Cite this article as:
- Ruiz-Vanoye, J.A., Pérez-Ortega, J., Pazos Rangel, R.A. et al. J. Zhejiang Univ. - Sci. C (2013) 14: 623. doi:10.1631/jzus.C1200349
- 102 Downloads
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.
Key wordsFormal languages Polynomial transformations NP-completeness
Unable to display preview. Download preview PDF.