首页> 外文期刊>Journal of Computational and Applied Mathematics >Survey of polynomial transformations between NP-complete problems
【24h】

Survey of polynomial transformations between NP-complete problems

机译:NP-完全问题之间的多项式变换的调查

获取原文
获取原文并翻译 | 示例
       

摘要

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.
机译:本文旨在通过介绍多项式约简/变换的方法以及约简和变换之间的差异,作为理解NP完全问题之间的多项式变换和多项式约简的指南。为此,本文显示了多项式约简/变换的示例,以及在NP完全问题之间进行约简/变换的限制。最后,本文包括一个有NP完全问题实例之间的历史归约/变换的有向图,并介绍了多项式变换的术语族。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号