Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 0799.68008
Welsh, D.J.A.
Complexity: Knots, colourings and counting. (English)
[B] London Mathematical Society Lecture Note Series. 186. Cambridge: Cambridge University Press. viii, 163 p. \sterling 19.95 (1993). ISBN 0-521-45740-8/pbk

The aim of these notes 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.\par To researchers in discrete mathematics, computer science and statistical physics, this book will be great interest, but any non-expert should find it an appealing guide to a very active area of research''.
[A.Brandstädt (Jena)]

MSC 2000:: *68-02 Research monographs (computer science)
57M25 Knots and links in the 3-sphere
03D15 Complexity of computation
68Q15 Complexity classes of computation
68R05 Combinatorics in connection with computer science
82B43 Percolation

Keywords: knot theory; counting problems; computational complexity; knot polynomials; number-$P$-completeness; statistical physics

Cited in: Zbl 1051.68116

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]