| Solving the factorization problem with P systems |
| |
| 作者单位： | Computer Science Department University of Milan，20126 Milano，Italy，Computer Science Department，University of Milan，20126 Milano，Italy，Computer Science Department，University of Milan，20126 Milano，Italy |
| |
| 基金项目： | This work has been partially supported by the Italian Ministry of University (MIUR) under the project PRIN-04 "Systems Biology: modellazione,linguaggi e analisi (SYBILLA)", and by the European Research Training Network Segravis |
| |
| 摘 要： | 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.
|
Solving the factorization problem with P systems |
| |
| Authors: | Alberto Leporati Claudio Zandron Giancarlo Mauri |
| |
| Abstract: | 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. |
| |
| Keywords: | factorization P systems membrane systems |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《自然科学进展(英文版)》浏览原始摘要信息 |
| 点击此处可从《自然科学进展(英文版)》下载免费的PDF全文 |
