Characterising the complexity of tissue P systems with fission rules

Leporati, 2014, Simulating elementary active membranes, with an application to the P conjecture, vol. 8961, 284 Leporati, 2015, Membrane division, oracles, and the counting hierarchy, Fund. Inform., 138, 97 Leporati, 2015, Tissue P systems can be simulated efficiently with counting oracles, vol. 9504, 251 Leporati, 2016, Shallow non-confluent P systems, vol. 10105, 307 Martín-Vide, 2003, Tissue P systems, Theoret. Comput. Sci., 296, 295, 10.1016/S0304-3975(02)00659-X Murphy, 2011, The computational power of membrane systems under tight uniformity conditions, Nat. Comput., 10, 613, 10.1007/s11047-010-9244-7 Pan, 2010, Computational complexity of tissue-like P systems, J. Complexity, 26, 296, 10.1016/j.jco.2010.03.001 Papadimitriou, 1993 Păun, 2000, Computing with membranes, J. Comput. System Sci., 61, 108, 10.1006/jcss.1999.1693 Păun, 2001, P systems with active membranes: attacking NP-complete problems, J. Autom. Lang. Comb., 6, 75 2010 Păun, 2008, Tissue P systems with cell division, Int. J. Comput. Commun. Control, 3, 295, 10.15837/ijccc.2008.3.2397 Pérez-Jiménez, 2014, The P versus NP problem from the membrane computing view, Eur. Rev., 22, 18, 10.1017/S1062798713000598 Song, 2015, Efficient solutions to hard computational problems by P systems with symport/antiport rules and membrane division, Biosystems, 130, 51, 10.1016/j.biosystems.2015.03.002 Sosík, 2003, The computational power of cell division in P systems: beating down parallel computers?, Nat. Comput., 2, 287, 10.1023/A:1025401325428 Sosík, 2014, Computational power of cell separation in tissue P systems, Inform. Sci., 279, 805, 10.1016/j.ins.2014.04.031 Sosík, 2015, A limitation of cell division in tissue P systems by PSPACE, J. Comput. System Sci., 81, 473, 10.1016/j.jcss.2014.10.006 Sosík, 2007, Membrane computing and complexity theory: a characterization of PSPACE, J. Comput. System Sci., 73, 137, 10.1016/j.jcss.2006.10.001 Toda, 1994, Simple characterizations of P(#P) and complete problems, J. Comput. System Sci., 49, 1, 10.1016/S0022-0000(05)80082-0 Wagner, 1986, The complexity of combinatorial problems with succinct input representation, Acta Inform., 23, 325, 10.1007/BF00289117