000			01415nas a22001937i 4500
999			_c89674 _d89674
003			CITU
005			20250519113947.0
008			250311c2021 ph |||p| |||| 00| 0 eng d
100	1		_aGranda, Justin. _eauthor
245	1	0	_aSolving the subset sum problem using distributed tissue-like P systems with cell division / _cJustin Granda, Samuel Jose and Kelvin Cui Buño.
264		4	_c2021
520			_aThe Subset Sum Problem is a decision problem where given a multiset of integers, a decision must be made on whether a subset of said set can be found where the sum of its elements is equal to a target value, or not. This problem is NP-Complete. Membrane computing is one of the ways used to approach these problems, using a computing model commonly referred to as P systems. In this work, we solve the Subset Sum Problem using dP systems where the components are tissue P systems with cell division. The 2-component solution proposed can generate candidate solutions twice as fast, as compared to the non-distributed solution it was based on. However, computation time is increased with respect to the target sum. Communication costs are analyzed and measured.
650		0	_aComputer systems.
650		0	_aMembrane computers.
700	1		_aJose, Samuel. _eauthor
700	1		_aBuño, Kelvin Cui. _eauthor
773			_tPhilippine Computing Journal _gvol. 16, no. 1: (Aug. 2021), pages 4-11.
942			_2ddc _cART