Cargando…
Complexity : knots, colourings, and counting /
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 comp...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Cambridge ; New York :
Cambridge University Press,
1993.
|
| Colección: | London Mathematical Society lecture note series ;
186. |
| Temas: | |
| Acceso en línea: | Texto completo |
| Sumario: | 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. |
|---|---|
| Descripción Física: | 1 online resource (viii, 163 pages) : illustrations |
| Bibliografía: | Includes bibliographical references (pages 143-159) and index. |
| ISBN: | 9781107088696 1107088690 9780511752506 0511752504 1107100577 9781107100572 1139884980 9781139884983 1107091632 9781107091634 1107103088 9781107103085 1107094909 9781107094901 0521457408 9780521457408 |