Solving the Factorization Problem with P Systems
P systems have been used many times to face with computationally di±cult prob- lems,such as NPcomplete decision problems and NPhard optimization problems.In this paper we focus our attention on another computationally intractable problem: Factorization.In par- ticular,we ˉrst propose a simple method to encode binary numbers using multisets.Then,we describe three families of P systems: the ˉrst two allow to add and to multiply two binary encoded numbers,respectively,while the third solves the Factorization problem.
Alberto Leporati Claudio Zandron Giancarlo Mauri
Dipartimento di Informatica,Sistemistica e Comunicazione Università degli Studi di Milano-Bicocca Via Bicocca degli Arcimboldi 8,20126 Milano,Italy
国际会议
武汉
英文
144-153
2006-09-18(万方平台首次上网日期,不代表论文的发表时间)