Abstract
In Subsection 2.3.11, we mentioned that many practical problems are intractable for normal computers, and that the parallelism is a possible way to cope with this situation. One of the main features of membrane systems is their inherent parallelism. Can this parallelism be used for solving — in theory — hard problems in a feasible time? The answer is positive, and we will illustrate it for various classes of P systems (with enhanced parallelism), which will be shown to be able to solve NP-complete problems in polynomial (often, linear) time. In order to have a systematic framework for assessing the quality of such a solution to a given problem, we start by introducing some new complexity classes, which seem to be appropriate to the membrane computing area.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Păun, G. (2002). Trading Space for Time. In: Membrane Computing. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56196-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-56196-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43601-0
Online ISBN: 978-3-642-56196-2
eBook Packages: Springer Book Archive