A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
In the field of membrane computing, a great attention is traditionally paid to the results demonstrating a theoretical possibility to solve NP-complete problems in polynomial time by means of various models of P systems. A bit less common is the fact that almost all models of P systems with this capability are actually stronger: some of them are able to solve PSPACEcomplete problems in polynomial time, while others have been recently shown to characterize the class # (which is conjectured to bedoi:10.1007/s41965-019-00017-y fatcat:4rs3f37vufcwja6fehdwdbqiom