Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Literature
DEVANEY, R. L., An introduction to chaotic dynamical systems Benjamin/Cummings Publishing Company Menlo Park, California 1986
KARP, R. M., Reducibility among combinatorial problems, in Miller and Thatcher, pp. 85–104, 1972
AHO, A. V., HOPCROFT, J. E., ULLMAN, J. D., The Design and Analysis of Computer Algorithms Addison Wesley, 1974
PERL, J., Algorithmen zum Knapsack-Problem Bericht Nr. 77-28, FB 20, TU-Berlin, 1977
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Perl, J. (1988). On chaotic behaviour of some np-complete problems. In: Göttler, H., Schneider, HJ. (eds) Graph-Theoretic Concepts in Computer Science. WG 1987. Lecture Notes in Computer Science, vol 314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19422-3_12
Download citation
DOI: https://doi.org/10.1007/3-540-19422-3_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19422-4
Online ISBN: 978-3-540-39264-4
eBook Packages: Springer Book Archive