Overview

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.

ISBN-13

9780521457408

ISBN-10

0521457408

Weight

0.57 Pounds

Dimensions

6.00 x 0.43 x 9.00 In

List Price

$37.99

Edition

1st Edition

Format

Paperback

Language

English

Pages

172 pages

Publisher

Cambridge University Press

Published On

1993-08-12



View All Offers

Sort by:

Rows per page:

1–5 of 5

Condition
Seller
Seller Comments
Price
Used, Very Good
Seller details
Wonder Book - Member ABAA/ILAB
★★★★★

Frederick, MD, USA

Very Good condition. A copy that may have a few cosmetic defects. May also contain light spine cre...
$22.04

 Free delivery by: 30 Mar 2026

Used, Like New
Seller details
Avon Hill Books
★★★★☆

Cambridge, MA, USA

0521457408. 8vo 8"-9" tall; 172 pp; London Mathematical Society Lecture Note Series, Series Number ...
$23.39

 Free delivery by: 30 Mar 2026

Used, Like New
Seller details
Zubal Books
★★★★★

Cleveland, OH, USA

163 pp., paperback, previous owner's name to the front free endpaper, else FINE. -If you are readi...
$24.83

 Free delivery by: 30 Mar 2026

Used, Good
Seller details
Bonita
★★★★☆

Santa Clarita, CA, USA

Access codes and supplements are not guaranteed with used items. May be an ex-library book.
$54.03

 Free delivery by: 30 Mar 2026


Bookstores.com relies on cookies to improve your experience.