Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Tissue P systems can be simulated efficiently with counting oracles

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
اقرأ أكثر حفظ في قائمتي
  • معلومة اضافية
    • Contributors:
      Leporati, A; Manzoni, L; Mauri, G; Porreca, A; Zandron, C
    • بيانات النشر:
      Springer Verlag
    • الموضوع:
      2015
    • Collection:
      Università degli Studi di Milano-Bicocca: BOA (Bicocca Open Archive)
    • نبذة مختصرة :
      We prove that polynomial-time tissue P systems with cell division or cell separation can be simulated efficiently by Turing machines with oracles for counting problems. This shows that the corresponding complexity classes are included in P#P, thus improving, under standard complexity theory assumptions, the previously known upper bound PSPACE.
    • Relation:
      info:eu-repo/semantics/altIdentifier/isbn/9783319284743; info:eu-repo/semantics/altIdentifier/wos/WOS:000375575200017; ispartofbook:16th International Conference on Membrane Computing, CMC 2015; Valencia; Spain; 17-21 August 2015; 16th International Conference on Membrane Computing, CMC 2015; volume:9504; firstpage:251; lastpage:261; numberofpages:11; serie:LECTURE NOTES IN COMPUTER SCIENCE; http://hdl.handle.net/10281/107102; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-84955237869; http://springerlink.com/content/0302-9743/copyright/2005/
    • الرقم المعرف:
      10.1007/978-3-319-28475-0_17
    • الدخول الالكتروني :
      http://hdl.handle.net/10281/107102
      https://doi.org/10.1007/978-3-319-28475-0_17
      http://springerlink.com/content/0302-9743/copyright/2005/
    • Rights:
      info:eu-repo/semantics/openAccess
    • الرقم المعرف:
      edsbas.F19D72F8