首页> 外文会议>Membrane computing >Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes
【24h】

Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes

机译:用主动膜的P系统解决PP完全和#P完全问题

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

摘要

Membrane computing is a formal framework of distributed parallel multiset processing. Due to massive parallelism and exponential space some intractable computational problems can be solved by P systems with active membranes in a polynomial number of steps. In this paper we generalize this approach from decisional problems to the computational ones, by providing a solution of a #P-complete problem, namely to compute the permanent of a binary matrix. The implication of this result to the PP complexity class is discussed and compared to known results about NP ∪ co - NP.
机译:膜计算是分布式并行多集处理的正式框架。由于大量的并行性和指数空间,一些具有活动膜的P系统可以通过多项式步数解决一些棘手的计算问题。在本文中,我们通过提供#P完全问题的解决方案,即计算二进制矩阵的永久性,将这种方法从决策问题推广到计算问题。讨论了该结果对PP复杂度类别的含义,并将其与有关NP∪co-NP的已知结果进行了比较。

著录项

  • 来源
    《Membrane computing》|2008年|108-117|共10页
  • 会议地点 Edinburgh(GB);Edinburgh(GB)
  • 作者单位

    Academy of Sciences of Moldova Institute of Mathematics and Computer Science Academiei 5, MD-2028, Chisinau, Moldova;

    Academy of Sciences of Moldova Institute of Mathematics and Computer Science Academiei 5, MD-2028, Chisinau, Moldova;

    Academy of Sciences of Moldova Institute of Mathematics and Computer Science Academiei 5, MD-2028, Chisinau, Moldova;

    Academy of Sciences of Moldova Institute of Mathematics and Computer Science Academiei 5, MD-2028, Chisinau, Moldova Rovira i Virgili University Research Group on Mathematical Linguistics Pl. Imperial Tarraco 1, 43005 Tarragona, Spain;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 混合集成电路;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号