【24h】

Accepting Networks of Splicing Processors

机译:接受拼接处理器的网络

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

摘要

We present linear time solutions to two NP-complete problems, namely SAT and the directed Hamiltonian Path Problem (HPP), based on accepting networks of splicing processors (ANSP) having all resources (size, number of rules and symbols) linearly bounded by the size of the given instance. The underlying structure of these ANSPs does not depend on the number of clauses, in the case of SAT, and the number of edges, in the case of HPP. Furthermore, the running time of the ANSP solving HPP does not depend on the number of edges of the given graph and this network provides all solutions, if any, of the given instance of HPP.
机译:我们根据两个处理器(ANSP)的接受网络(它们的所有资源(大小,规则数和符号数)都由线性限制)来给出两个NP完全问题(即SAT和有向哈密顿路径问题(HPP))的线性时间解。给定实例的大小。对于SAT,这些ANSP的基础结构不取决于子句的数目,对于HPP,不取决于边的数目。此外,ANSP解决HPP的运行时间不取决于给定图的边数,并且该网络提供了给定HPP实例的所有解决方案(如果有)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号