作者: Tseren-Onolt Ishdorj , Alberto Leporati , Linqiang Pan , Xiangxiang Zeng , Xingyi Zhang
DOI: 10.1016/J.TCS.2010.01.019
关键词:
摘要: In this paper we continue previous studies on the computational efficiency of spiking neural P systems, under assumption that some pre-computed resources exponential size are given in advance. Specifically, give a deterministic solution for each two well known PSPACE-complete problems: QSAT and Q3SAT. case QSAT, answer to any instance problem is computed time which linear with respect both number n Boolean variables m clauses compose instance. As Q3SAT, at most cubic variables.