Design Patterns for Efficient Solutions to NP-Complete Problems in Membrane Computing
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] Petr Sosík. The computational power of cell division in P systems: Beating down parallel computers? , 2004, Natural Computing.
[3] Mario J. Pérez-Jiménez,et al. Reaching efficiency through collaboration in membrane systems: Dissolution, polarization and cooperation , 2017, Theor. Comput. Sci..
[4] Linqiang Pan,et al. P Systems with Active Membranes and Separation Rules , 2004, J. Univers. Comput. Sci..
[5] Mario J. Pérez-Jiménez,et al. A uniform solution to SAT using membrane creation , 2007, Theor. Comput. Sci..
[6] Lance Fortnow,et al. A Short History of Computational Complexity , 2003, Bull. EATCS.
[7] Artiom Alhazov,et al. Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes , 2003, Fundam. Informaticae.
[8] Artiom Alhazov,et al. Uniform Solution of , 2007, MCU.
[9] Mario J. Pérez-Jiménez,et al. Complexity classes in models of cellular computing with membranes , 2003, Natural Computing.
[10] Gheorghe Paun,et al. The Oxford Handbook of Membrane Computing , 2010 .
[11] Giancarlo Mauri,et al. The counting power of P systems with antimatter , 2017, Theor. Comput. Sci..
[12] Gheorghe Paun. P Systems with Active Membranes: Attacking NP-Complete Problems , 2001, J. Autom. Lang. Comb..
[13] Mario J. Pérez-Jiménez,et al. A Polynomial Complexity Class in P Systems Using Membrane Division , 2003, DCFS.
[14] Gheorghe Paun,et al. Computing with Membranes , 2000, J. Comput. Syst. Sci..
[15] Giancarlo Mauri,et al. Elementary Active Membranes Have the Power of Counting , 2011, Int. J. Nat. Comput. Res..
[16] Agustín Riscos-Núñez,et al. From distribution to replication in cooperative systems with active membranes: A frontier of the efficiency , 2017, Theor. Comput. Sci..