Sciweavers

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

96

EATCS
2000

94views more EATCS 2000»

Computing with Membranes: One More Collapsing Hierarchy

15 years 2 months ago

Computing with Membranes: One More Collapsing Hierarchy

Download psystems.disco.unimib.it

Carlos Martín-Vide, Gheorghe Paun

Real-time Traffic

EATCS 2000 |

claim paper

Related Content

» Collapsing the Hierarchy of Parallel Computational Models

» Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible

» Proving SAT does not have Small Circuits with an Application to the Two

» The Power of Communication P Systems with SymportAntiport

» Membrane Computing The Power of Rule Creation

» Unambiguous Computation Boolean Hierarchies and Sparse TuringComplete Sets

» Random Access to Advice Strings and Collapsing Results

» On the Power of P Systems with Symport Rules

» Amplifying ZPPSAT1 and the Two Queries Problem

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	EATCS
Authors	Carlos Martín-Vide, Gheorghe Paun

Comments (0)