Skip to main content
SpringerLink
Log in
Book cover

Workshop on Membrane Computing

WMC 2000: Multiset Processing pp 267–285Cite as

On P Systems with Active Membranes Solving the Integer Factorization Problem in a Polynomial Time

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2235))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brainerd, W. S., Landweber, L. H. (1974): Theory of Computation. New York

    Google Scholar 

  2. Koblitz, N. (1998): Algebraic Aspects of Cryptography. Berlin

    Google Scholar 

  3. Lenstra, A. K., Lenstra, H. W., Jr. (1993): The Development of the Number Field Sieve. Lecture Notes in Mathematics, 1554, Berlin

    Google Scholar 

  4. Menezes, A. J., van Oorschot, P. C., Vanstone, S. A. (1996): Handbook of Applied Cryptography. CRC Press, Boca Raton

    Google Scholar 

  5. Meyer, A. R., Ritchie, D. M. (1967): The complexity of loop programs. Proceedings of the ACM National Meeting, ACM Pub. P-67, 465–469

    Google Scholar 

  6. Papadimitriou, Ch. P. (1994): Computational Complexity. Reading, Massachusetts

    Google Scholar 

  7. Păun, Gh. (2000a): P-Systems with Active Membranes: Attacking NP Complete Problems. Journal of Automata, Languages and Combinatorics, 6 (2000), 75–90

    Google Scholar 

  8. Păun, Gh. (2000b): Computing with Membranes. Journal of Computer and System Sciences, 61 (2000) 108–143

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Polish Academy of Sciences, ’Sniadeckich 8, P.O. Box 137, 00-950, Warsaw, Poland

    Adam Obtułowicz

Authors
  1. Adam Obtułowicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science Center for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland

    Cristian S. Calude

  2. Institute of Mathematics of the Romanian Academy, Romanian

    Gheorghe PĂun

  3. Leiden Institute for Advanced Computer Science, Leiden University, Leiden

    Grzegorz Rozenberg

  4. Turku Center for Computer Science, TUCS, Turku

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Obtułowicz, A. (2001). On P Systems with Active Membranes Solving the Integer Factorization Problem in a Polynomial Time. In: Calude, C.S., PĂun, G., Rozenberg, G., Salomaa, A. (eds) Multiset Processing. WMC 2000. Lecture Notes in Computer Science, vol 2235. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45523-X_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-45523-X_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43063-6

  • Online ISBN: 978-3-540-45523-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation