Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Journal of Computer and System Sciences
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Theoretical Computer Science - Natural computing
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Towards a Hierarchy of Conformons-P Systems
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Computing with Membranes: P Systems with Worm-Objects
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
The conformon-P system: a molecular and cell biology-inspired computability model
Theoretical Computer Science
Sequential p systems with unit rules and energy assigned to membranes
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Universal families of reversible p systems
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
A membrane algorithm for the min storage problem
WMC'06 Proceedings of the 7th international conference on Membrane Computing
| Hi-index | 0.00 |
Energy–based P systems have been recently introduced as P systems in which the amount of energy consumed and/or manipulated during computations is taken into account. In this paper we consider conservative computations performed by energy–based P systems, that is, computations for which the amount of energy entering the system is the same as the amount of energy leaving it. We show that conservative computations naturally allow to define an NP–hard optimization problem, here referred to as Min Storage, and a corresponding NP–complete decision problem, ConsComp. Finally, we present a polynomial time 2–approximation algorithm for Min Storage.