%0 Journal Article
%T Solving the factorization problem with P systems
%A Alberto Leporati
%A Claudio Zandron
%A Giancarlo Mauri
%A <br>Alberto Leporati
%A Claudio Zandron and Giancarlo Mauri
%J 自然科学进展
%D 2007
%I 
%X P systems have been used many times to face with computationally difficult problems, such as NP-complete decision problems and NP-hard optimization problems. In this paper we focus our attention on another computationally intractable problem: factorization. In particular, we first propose a simple method to encode binary numbers using multisets. Then, we describe three families of P systems: the first two allow to add and to multiply two binary encoded numbers, respectively, and the third solves the factorization problem.
%K factorization
%K P systems
%K membrane systems<br>
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=96E6E851B5104576C2DD9FC1FBCB69EF&jid=504AF8C1E5476CA7C4EC9DF6FEAC14AC&aid=B7978F2A8818E159155186C12BA7231B&yid=A732AF04DDA03BB3&vid=BCA2697F357F2001&iid=E158A972A605785F&sid=DCE57F652E4ADAFC&eid=A94616C4391AA5EF&journal_id=1002-008X&journal_name=自然科学进展&referenced_num=0&reference_num=0