Abstract
The computational complexity of a composite system can be measured in terms of the tree width of its interaction scheme. This is exemplified by algorithms for the computation of (i) the ground state, (ii) its degeneracy, and (iii) the free energy of finite spin glass systems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Felsenstein, Quat. Rev. Biol. 57 (1984).
A. W. M. Dress, M. Krüger, Adv. in Appl. Math. (1987).
Chr. von der Malsburg, Ber. Bunsenges. Phys. Chem. 89, 703 (1985).
S. F. Edwards, P. W. Anderson, J. Phys. F 5, 965 (1975).
F. S. Makedon, C. H. Papadimitriou, R. H. Sudborough, SIAM J. Alg. Disc. Meth. 6, 418 (1985).
S. Kirkpatrick, C. D. Gelatt, M. F. Vecchi, Science 220, 671 (1983).
I. Rechenberg, Evolutionsstrategie, Optimierung technischer Systeme nach Prinzipien der biologischen Evolution, Stuttgart-Bad Cannstatt (1973)
R. Rammal, G. Toulouse, M. A. Virascro, Rev. Mod. Phys. (1986).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag
About this paper
Cite this paper
Dress, A.W.M. (1987). On the computational complexity of composite systems. In: Garrido, L. (eds) Fluctuations and Stochastic Phenomena in Condensed Matter. Lecture Notes in Physics, vol 268. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17206-8_16
Download citation
DOI: https://doi.org/10.1007/3-540-17206-8_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17206-2
Online ISBN: 978-3-540-47401-2
eBook Packages: Springer Book Archive