作者: Pierluigi Frisco , Gordon Govan
DOI: 10.1007/978-3-642-28024-5_12
关键词: Theoretical computer science 、 Membrane 、 Mathematics 、 Time complexity 、 Exponential space 、 True quantified Boolean formula 、 Conjunctive normal form 、 Parallel computing 、 Parallelism (grammar)
摘要: We prove that P systems with active membranes operating under minimal parallelism are able to solve NP-complete and PP-complete problems in linear time exponential space when using different types of rules. also these can simulate register machines.