Limits on Efficient Computation in P Systems with Symport/Antiport Rules
暂无分享,去创建一个
[1] Gheorghe Paun. P Systems with Active Membranes: Attacking NP-Complete Problems , 2001, J. Autom. Lang. Comb..
[2] Mario J. Pérez-Jiménez,et al. Computational complexity of tissue-like P systems , 2010, J. Complex..
[3] Mario J. Pérez-Jiménez,et al. Complexity classes in models of cellular computing with membranes , 2003, Natural Computing.
[4] Andrei Paun,et al. The power of communication: P systems with symport/antiport , 2002, New Generation Computing.
[5] Xin-She Yang,et al. Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.
[6] Mario de Jesús Pérez Jiménez,et al. Characterizing tractability by tissue-like p systems , 2009 .
[7] Gheorghe Paun,et al. Computing with Membranes , 2000, J. Comput. Syst. Sci..
[8] Gheorghe Paun,et al. Computing with Membranes: Attacking NP-Complete Problems , 2000, UMC.
[9] Pierluigi Frisco. Computing with Cells - Advances in Membrane Computing , 2009 .
[10] Gheorghe Paun. Spiking Neural P Systems: A Tutorial , 2007, Bull. EATCS.
[11] Ping Guo,et al. Solving the 0-1 Knapsack Problem by Using Tissue P System With Cell Division , 2019, IEEE Access.
[12] Andrei Paun,et al. Computing by Communication in Networks of Membranes , 2002, Int. J. Found. Comput. Sci..
[13] Alfonso Rodríguez-Patón,et al. Tissue P systems , 2003, Theor. Comput. Sci..
[14] Mario J. Pérez-Jiménez,et al. A Polynomial Complexity Class in P Systems Using Membrane Division , 2003, DCFS.
[15] Linqiang Pan,et al. P Systems with Active Membranes and Separation Rules , 2004, J. Univers. Comput. Sci..