On chaotic behaviour of some np-complete problems

  • Juergen Perl
Randomness And Chaos
Part of the Lecture Notes in Computer Science book series (LNCS, volume 314)


The paper deals with a structural relations between chaotic dynamical systems on the one hand and np-complete problems, in particular: knap-sack, on the other hand.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    DEVANEY, R. L., An introduction to chaotic dynamical systems Benjamin/Cummings Publishing Company Menlo Park, California 1986Google Scholar
  2. [2]
    KARP, R. M., Reducibility among combinatorial problems, in Miller and Thatcher, pp. 85–104, 1972Google Scholar
  3. [3]
    AHO, A. V., HOPCROFT, J. E., ULLMAN, J. D., The Design and Analysis of Computer Algorithms Addison Wesley, 1974Google Scholar
  4. [4]
    PERL, J., Algorithmen zum Knapsack-Problem Bericht Nr. 77-28, FB 20, TU-Berlin, 1977Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Juergen Perl
    • 1
  1. 1.Universitaet MainzGermany

Personalised recommendations