Complexity: Knots, Colourings and Countings

Dominic Welsh (Autor)

Buch | Softcover

172 Seiten

1993
Cambridge University Press (Verlag)
978-0-521-45740-8 (ISBN)

Artikel merken

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.

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.

Erscheint lt. Verlag	12.8.1993
Reihe/Serie	London Mathematical Society Lecture Note Series
Zusatzinfo	Worked examples or Exercises
Verlagsort	Cambridge
Sprache	englisch
Maße	151 x 227 mm
Gewicht	259 g
Themenwelt	Mathematik / Informatik ► Informatik ► Theorie / Studium
	Mathematik / Informatik ► Mathematik ► Geometrie / Topologie
	Mathematik / Informatik ► Mathematik ► Graphentheorie
	Naturwissenschaften ► Physik / Astronomie ► Thermodynamik
ISBN-10	0-521-45740-8 / 0521457408
ISBN-13	978-0-521-45740-8 / 9780521457408
Zustand	Neuware