Tissue P systems with cell separation: upper bound by PSPACE
DOI10.1007/978-3-642-33860-1_17zbMATH Open1374.68222OpenAlexW154372911MaRDI QIDQ4649282FDOQ4649282
Authors: Petr Sosík, Luděk Cienciala 
Publication date: 21 November 2012
Published in: Theory and Practice of Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-33860-1_17
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (12)
- An optimal frontier of the efficiency of tissue P systems with cell separation
- P systems attacking hard problems beyond NP: a survey
- A uniform solution to the independent set problem through tissue P systems with cell separation
- A uniform family of tissue P systems with protein on cells solving 3-coloring in linear time
- Computational complexity of tissue-like P systems
- The computational power of tissue-like P systems with promoters
- Limits of the power of tissue P systems with cell division
- A time-free uniform solution to subset sum problem by tissue P systems with cell division
- Tissue P systems with cell separation: attacking the partition problem
- A limitation of cell division in tissue P systems by PSPACE
- Homeostasis tissue-like P systems with cell separation
- Computational power of cell separation in tissue P systems
This page was built for publication: Tissue P systems with cell separation: upper bound by PSPACE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649282)
