Isbn: 9780521457408 - complexity: knots, colourings and counting (london mathematical society, lecture note series, vol.186) (6 Ergebnisse)

Zustand: Fine. 163 pp., paperback, previous owner's name to the front free endpaper, else FINE. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.…

Softcover. Zustand: Gut. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 05 WEL 9780521457408 Sprache: Englisch Gewicht in Gramm: 500.…

Softcover. Zustand: Gut. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 05 WEL 9780521457408 Sprache: Englisch Gewicht in Gramm: 550.…

Zustand: New. In.

Zustand: New. These notes are based on a series of lectures given at the Advanced Research Institute of Discrete Applied Mathematics, Rutgers University. Series Editor(s): Hitchin, N. J. Series: London Mathematical Society Lecture Note Series. Num Pages: 172 pages, 70 line figures. BIC Classification: PBP; PBV; PHS; UYA. Category: (P) Professional & Vocational. Dimension: 229 x 152 x 10. Weight in Grams: 260. . 1993. Illustrated. paperback. . . . . Books ship from the US and Ireland.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…