Solving subset sum and SAT problems by reaction systems

IF 1.7 4区计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

Natural Computing Pub Date : 2024-04-06 DOI:10.1007/s11047-024-09972-7

引用次数: 0

Abstract

We study the efficiency of the reaction systems in solving NP-complete problems. Due to the fact that standard reaction systems are qualitative, in order to accomplish our aim, in this paper we consider communicating reaction systems with direct communication extended with duration for resources and a mutual exclusion relation between reactions forbidding two reactions to be used in the same step, in parallel. We show that these systems, working in a non-deterministic way, are powerful enough to provide polynomial-time solutions to the subset sum and SAT problems. We consider a semi-uniform approach by constructing a system for each instance of the subset sum and SAT problems and embedding the parameters into the constructed systems.

查看原文本刊更多论文

用反应系统解决子集和与 SAT 问题

摘要我们研究了反应系统在解决 NP-完全问题时的效率。由于标准反应系统是定性的，为了实现我们的目标，本文考虑了通信反应系统，该系统具有直接通信功能，扩展了资源的持续时间，以及反应之间的互斥关系，禁止在同一步骤中并行使用两个反应。我们的研究表明，这些系统以非决定性方式工作，足以为子集求和与 SAT 问题提供多项式时间解决方案。我们考虑了一种半统一方法，即为子集和与 SAT 问题的每个实例构建一个系统，并将参数嵌入所构建的系统中。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Natural Computing Computer Science-Computer Science Applications

CiteScore

4.40

自引率

4.80%

发文量

审稿时长

3 months

期刊介绍： The journal is soliciting papers on all aspects of natural computing. Because of the interdisciplinary character of the journal a special effort will be made to solicit survey, review, and tutorial papers which would make research trends in a given subarea more accessible to the broad audience of the journal.