作者: Luis Valencia-Cabrera , David Orellana-Martín , Miguel Á. Martínez-del-Amor , Ignacio Pérez-Hurtado , Mario J. Pérez-Jiménez
DOI: 10.1155/2020/6765097
关键词: Upper and lower bounds 、 Combinatorics 、 Completeness (order theory) 、 Membrane computing 、 Time complexity 、 Reduction (recursion theory) 、 Mathematics
摘要: Presumably efficient computing models are characterized by their capability to provide polynomial-time solutions for NP -complete problems. Given a class of recognizer membrane systems, denotes the set decision problems solvable families from in polynomial time and uniform way. is closed under complement reduction. Therefore, if presumably model then   co - . In this paper, lower bound complexity improved any systems verifying some simple requirements. Specifically, it shown that DP such , where differences two languages Since delimits thinner frontier than with