Solving a PSPACE-complete problem with cP systems

被引:10
|
作者
Henderson, Alec [1 ]
Nicolescu, Radu [1 ]
Dinneen, Michael J. [1 ]
机构
[1] Univ Auckland, Sch Comp Sci, Auckland, New Zealand
关键词
Membrane computing; cP systems; Computational complexity; QSAT;
D O I
10.1007/s41965-020-00064-w
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
There have been a few NP-hard problems solved using cP systems including the travelling salesman problem. However, these problems are typically in NP rather than higher in the polynomial time hierarchy. In this paper, we solve QSAT (also known as TQBF), which is a well-known PSPACE-complete problem. Compared to other extant confluent P systems solutions, our deterministic cP solution only uses a small constant number of custom alphabet symbols (19), a small constant number of rules (10) and a small constant upper limit of membrane nesting depth (6), independent of the problem size.
引用
收藏
页码:311 / 322
页数:12
相关论文
共 50 条
  • [31] Online Chromatic Number is PSPACE-Complete
    Bohm, Martin
    Vesely, Pavel
    THEORY OF COMPUTING SYSTEMS, 2018, 62 (06) : 1366 - 1391
  • [32] Friends-and-strangers is PSPACE-complete
    Yang, Chao
    Zhang, Zhujun
    INFORMATION PROCESSING LETTERS, 2025, 190
  • [33] Stochastic Muller games are PSPACE-complete
    Chatterjee, Krishnendu
    FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2007, 4855 : 436 - 448
  • [34] Convergence of Opinion Diffusion is PSPACE-Complete
    Chistikov, Dmitry
    Lisowski, Grzegorz
    Paterson, Mike
    Turrini, Paolo
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 7103 - 7110
  • [35] Optimizing the Region Algebra is PSPACE-complete
    Gelade, Wouter
    Neven, Frank
    INFORMATION PROCESSING LETTERS, 2010, 110 (16) : 639 - 643
  • [36] Task and Motion Planning Is PSPACE-Complete
    Vega-Brown, William
    Roy, Nicholas
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 10385 - 10392
  • [37] Online Chromatic Number is PSPACE-Complete
    Martin Böhm
    Pavel Veselý
    Theory of Computing Systems, 2018, 62 : 1366 - 1391
  • [38] A PSPACE-complete sperner triangle game
    Burke, Kyle W.
    Teng, Shang-Hua
    INTERNET AND NETWORK ECONOMICS, PROCEEDINGS, 2007, 4858 : 445 - 456
  • [39] PROOF EQUIVALENCE IN MLL IS PSPACE-COMPLETE
    Heijltjes, Willem
    Houston, Robin
    LOGICAL METHODS IN COMPUTER SCIENCE, 2016, 12 (01)
  • [40] Solution to PSPACE-Complete Problem Using P Systems with Active Membranes with Time-Freeness
    Song, Bosheng
    Kong, Yuan
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2019, 2019