Auf ein Miniaturbild klicken, um zu Google Books zu gelangen.
Lädt ... Complexity: Knots, Colourings and Countings (London Mathematical Society Lecture Note Series)von D. J. A. Welsh
Keine Lädt ...
Melde dich bei LibraryThing an um herauszufinden, ob du dieses Buch mögen würdest. Keine aktuelle Diskussion zu diesem Buch. Keine Rezensionen keine Rezensionen | Rezension hinzufügen
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. Keine Bibliotheksbeschreibungen gefunden. |
Aktuelle DiskussionenKeine
Google Books — Lädt ... GenresMelvil Decimal System (DDC)511.3Natural sciences and mathematics Mathematics General Principles Mathematical (Symbolic) logicKlassifikation der Library of Congress [LCC] (USA)BewertungDurchschnitt:
Bist das du?Werde ein LibraryThing-Autor. |