BWMC2011. Brainstorming Week On Membrane Computing (9th. 2011. Sevilla)http://hdl.handle.net/11441/343612017-11-22T14:35:51Z2017-11-22T14:35:51ZNinth Brainstorming Week on Membrane Computing, Sevilla, January 31 - February 4, 2011 : RGNC REPORT 1/2011Martínez del Amor, Miguel ÁngelPaun, GheorghePérez Hurtado de Mendoza, IgnacioRomero Campero, Francisco JoséValencia Cabrera, Luishttp://hdl.handle.net/11441/396892016-11-29T13:02:24Z2011-01-01T00:00:00ZNinth Brainstorming Week on Membrane Computing, Sevilla, January 31 - February 4, 2011 : RGNC REPORT 1/2011
2011-01-01T00:00:00ZLinear Time Solution to Prime Factorization by Tissue P Systems with Cell DivisionZhang, XingyiNiu, YunyunPan, LinqiangPérez Jiménez, Mario de Jesúshttp://hdl.handle.net/11441/396752016-11-29T13:02:25Z2011-01-01T00:00:00ZLinear Time Solution to Prime Factorization by Tissue P Systems with Cell Division
Prime factorization is useful and crucial for public-key cryptography, and its
application in public-key cryptography is possible only because prime factorization has
been presumed to be difficult. A polynomial-time algorithm for prime factorization on a
quantum computer is given by P. W. Shor in 1997. In this work, a linear-time solution
for prime factorization is given on a kind of biochemical computational devices - tissue
P systems with cell division, instead of physical computational devices.
2011-01-01T00:00:00ZInteger Linear Programming for Tissue-like P SystemsReina Molina, RaúlDíaz Pernil, DanielGutiérrez Naranjo, Miguel Ángelhttp://hdl.handle.net/11441/396722016-11-29T12:33:18Z2011-01-01T00:00:00ZInteger Linear Programming for Tissue-like P Systems
In this paper we report a work-in-progress whose final target is the implementation of tissue-like P system in a cluster of computers which solves some instances
of the segmentation problem in 2D Digital Imagery. We focus on the theoretical aspects
and the problem of choosing a maximal number of application of rules by using Integer
Linear Programming techniques. This study is on the basis of a future distribution of the
parallel work among the processors.
2011-01-01T00:00:00ZElementary Active Membranes Have the Power of CountingPorreca, Antonio E.Leporati, AlbertoMauri, GiancarloZandron, Claudiohttp://hdl.handle.net/11441/396652016-11-30T07:43:43Z2011-01-01T00:00:00ZElementary Active Membranes Have the Power of Counting
We prove that uniform families of P systems with active membranes operat-
ing in polynomial time can solve the whole class of PP decision problems, without using
nonelementary membrane division or dissolution rules. This result also holds for families
having a stricter uniformity condition than the usual one.
2011-01-01T00:00:00Z