P Systems Simulating Oracle Computations
暂无分享,去创建一个
[1] Artiom Alhazov,et al. Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes , 2003, Fundam. Informaticae.
[2] Gheorghe Paun. P Systems with Active Membranes: Attacking NP-Complete Problems , 2001, J. Autom. Lang. Comb..
[3] Mario J. Pérez-Jiménez,et al. Complexity classes in models of cellular computing with membranes , 2003, Natural Computing.
[4] Alfonso Rodríguez-Patón,et al. Membrane computing and complexity theory: A characterization of PSPACE , 2007, J. Comput. Syst. Sci..
[5] Seinosuke Toda,et al. PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..
[6] Petr Sosík. The computational power of cell division in P systems: Beating down parallel computers? , 2004, Natural Computing.
[7] Giancarlo Mauri,et al. Elementary Active Membranes Have the Power of Counting , 2011, Int. J. Nat. Comput. Res..
[8] Giancarlo Mauri,et al. Solving NP-Complete Problems Using P Systems with Active Membranes , 2000, UMC.
[9] Giancarlo Mauri,et al. An Efficient Simulation of Polynomial-Space Turing Machines by P Systems with Active Membranes , 2009, Workshop on Membrane Computing.
[10] Niall Murphy,et al. The computational power of membrane systems under tight uniformity conditions , 2010, Natural Computing.