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.

Leporati, A., Zandron, C., & Mauri, G. (2007). Solving the Factorization Problem with P Systems. PROGRESS IN NATURAL SCIENCE, 17(4), 471-478 [10.1080/10020070708541025].

Solving the Factorization Problem with P Systems

LEPORATI, ALBERTO OTTAVIO;ZANDRON, CLAUDIO;MAURI, GIANCARLO
2007

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.
No
Articolo in rivista - Articolo scientifico
Scientifica
P systems; Factorization problem
English
471
478
8
Leporati, A., Zandron, C., & Mauri, G. (2007). Solving the Factorization Problem with P Systems. PROGRESS IN NATURAL SCIENCE, 17(4), 471-478 [10.1080/10020070708541025].
Leporati, A; Zandron, C; Mauri, G
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/10281/2497
Citazioni
  • Scopus 7
  • ???jsp.display-item.citation.isi??? 5
Social impact