Algebraic aspects of cryptography
Algebraic aspects of cryptography
Journal of Computer and System Sciences
P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Theory of Computation
The complexity of loop programs
ACM '67 Proceedings of the 1967 22nd national conference
Theoretical Computer Science - Natural computing
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Mathematical models of uncertainty with a regard to membrane systems
Natural Computing: an international journal
Membrane computing as a modeling framework: cellular systems case studies
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
An approach to computational complexity in membrane computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
On the efficiency of p systems with active membranes and two polarizations
WMC'04 Proceedings of the 5th international conference on Membrane Computing
General multi-fuzzy sets and fuzzy membrane systems
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Hi-index | 0.00 |
There are presented deterministic P systems with active membranes which are able to solve the Integer Factorization Problem in a polynomial time, which is the main result of the paper. There is introduced a class of programs for the description and correct implementation of algorithms of elementary number theory in nonstandard computing systems, especially in P systems with active membranes. By using some of these programs there is achieved the main result.