Login / Signup

Application of formal languages in polynomial transformations of instances between NP-complete problems.

Jorge A. Ruiz-VanoyeJoaquín Pérez OrtegaRodolfo A. Pazos RangelOcotlán Díaz-ParraHéctor Joaquín Fraire HuacujaJuan Frausto SolísGerardo Reyes SalgadoLaura Cruz Reyes
Published in: J. Zhejiang Univ. Sci. C (2013)
Keyphrases
  • np complete problems
  • formal languages
  • np complete
  • graph coloring
  • data model
  • np hard
  • phase transition
  • context free grammars
  • hard problems