Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

83

Voted

UMC
2000

favoriteEmaildiscussreport

206views Applied Computing» more UMC 2000»

Solving NP-Complete Problems Using P Systems with Active Membranes

15 years 1 months ago

Solving NP-Complete Problems Using P Systems with Active Membranes

Download psystems.disco.unimib.it

Claudio Zandron, Claudio Ferretti, Giancarlo Mauri

Real-time Traffic

Applied Computing | UMC 2000 |

claim paper

Related Content

» Replicative Distribution Rules in P Systems with Active Membranes

» Solving HPP and SAT by P Systems with Active Membranes and Separation Rules

» P systems with active membranes trading time for space

» On a Powerful Class of Nonuniversal P Systems with Active Membranes

» Boolean Circuits and a DNA Algorithm in Membrane Computing

» Nonconfluence in divisionless P systems with active membranes

» Power and Efficiency of Minimal Parallelism in Polarizationless P Systems

» Minimal Parallelism for Polarizationless P Systems

» P Systems with Active Membranes Characterize PSPACE

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	2000
Where	UMC
Authors	Claudio Zandron, Claudio Ferretti, Giancarlo Mauri

Comments (0)