Complexity

Knots, Colourings and Counting
Erscheinungsjahr 1993
ISBN: 978-0-521-45740-8
Verlag: Cambridge University Press

Buch, Englisch, Band 186, 171 Seiten, Format (B × H): 152 mm x 229 mm, Gewicht: 259 g

Reihe: London Mathematical Society Lecture Note Series

These notes are based on a series of lectures given at the Advanced Research Institute of Discrete Applied Mathematics held at Rutgers University. Their aim is to link together algorithmic problems arising in knot theory, statistical physics and classical combinatorics. Apart from the theory of computational complexity concerned with enumeration problems, introductions are given to several of the topics treated, such as combinatorial knot theory, randomised approximation algorithms, percolation and random cluster models. To researchers in discrete mathematics, computer science and statistical physics, this book will be of great interest, but any non-expert should find it an appealing guide to a very active area of research.

Autoren/Hrsg.

Welsh, D. J. A.

Welsh, Dominic

Fachgebiete

• Mathematik | Informatik Mathematik Topologie Mengentheoretische Topologie
• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
• Mathematik | Informatik Mathematik Operations Research Graphentheorie
• Naturwissenschaften Physik Angewandte Physik Statistische Physik, Dynamische Systeme

Inhaltsverzeichnis

1. The complexity of enumeration; 2. Knots and links; 3. Colourings, flows and polynomials; 4. Statistical physics; 5. Link polynomials; 6. Complexity questions; 7. The complexity of uniqueness and parity; 8. Approximation and randomisation; References.