Cliquer sur une vignette pour aller sur Google Books.
Chargement... Complexity: Knots, Colourings and Countings (London Mathematical Society Lecture Note Series)par D. J. A. Welsh
Aucun Chargement...
Inscrivez-vous à LibraryThing pour découvrir si vous aimerez ce livre Actuellement, il n'y a pas de discussions au sujet de ce livre. Aucune critique aucune critique | ajouter une critique
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. Aucune description trouvée dans une bibliothèque |
Discussion en coursAucun
Google Books — Chargement... GenresClassification décimale de Melvil (CDD)511.3Natural sciences and mathematics Mathematics General Principles Mathematical (Symbolic) logicClassification de la Bibliothèque du CongrèsÉvaluationMoyenne:
Est-ce vous ?Devenez un(e) auteur LibraryThing. |