The intersection of combinatorics and statistical physics has experienced great activity in recent years. This flurry of activity has been fertilized by an exchange not only of techniques, but also of objectives. Computer scientists interested in approximation algorithms have helped statistical physicists and discrete mathematicians overcome language problems. They have found a wealth of common ground in probabilistic combinatorics. Close connections between percolation and random graphs, graph morphisms and hard-constraint models, and slow mixing and phase transition have led to new results and perspectives. These connections can help in understanding typical behavior of combinatorial phenomena such as graph coloring and homomorphisms. Inspired by issues and intriguing new questions surrounding the interplay of combinatorics and statistical physics, a DIMACS/DIMATIA workshop was held at Rutgers University. These proceedings are the outgrowth of that meeting. This volume is intended for graduate students and research mathematicians interested in probabilistic graph theory and its applications.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur FW-9780821835517
Quantité disponible : 2 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Hardcover. Etat : Brand New. illustrated edition edition. 193 pages. 10.20x6.90x0.70 inches. In Stock. N° de réf. du vendeur __0821835513
Quantité disponible : 2 disponible(s)
Vendeur : Rarewaves.com USA, London, LONDO, Royaume-Uni
Hardback. Etat : New. The intersection of combinatorics and statistical physics has experienced great activity in recent years. This flurry of activity has been fertilized by an exchange not only of techniques, but also of objectives. Computer scientists interested in approximation algorithms have helped statistical physicists and discrete mathematicians overcome language problems. They have found a wealth of common ground in probabilistic combinatorics. Close connections between percolation and random graphs, graph morphisms and hard-constraint models, and slow mixing and phase transition have led to new results and perspectives. These connections can help in understanding typical behavior of combinatorial phenomena such as graph coloring and homomorphisms. Inspired by issues and intriguing new questions surrounding the interplay of combinatorics and statistical physics, a DIMACS/DIMATIA workshop was held at Rutgers University. These proceedings are the outgrowth of that meeting. This volume is intended for graduate students and research mathematicians interested in probabilistic graph theory and its applications. N° de réf. du vendeur LU-9780821835517
Quantité disponible : 1 disponible(s)
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Etat : New. Inspired by issues and intriguing questions surrounding the interplay of combinatorics and statistical physics, a DIMACS/DIMATIA workshop was held at Rutgers University. This title includes proceedings of that meeting. It is suitable for graduate students and research mathematicians interested in probabilistic graph theory and its applications. Editor(s): Nesetril, Jaroslav; Winkler, P. Series: DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. Num Pages: 193 pages, Illustrations. BIC Classification: PBPD; PBV; PBWL. Category: (P) Professional & Vocational. Weight in Grams: 595. . 2004. hardcover. . . . . N° de réf. du vendeur V9780821835517
Quantité disponible : 1 disponible(s)
Vendeur : Kennys Bookstore, Olney, MD, Etats-Unis
Etat : New. Inspired by issues and intriguing questions surrounding the interplay of combinatorics and statistical physics, a DIMACS/DIMATIA workshop was held at Rutgers University. This title includes proceedings of that meeting. It is suitable for graduate students and research mathematicians interested in probabilistic graph theory and its applications. Editor(s): Nesetril, Jaroslav; Winkler, P. Series: DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. Num Pages: 193 pages, Illustrations. BIC Classification: PBPD; PBV; PBWL. Category: (P) Professional & Vocational. Weight in Grams: 595. . 2004. hardcover. . . . . Books ship from the US and Ireland. N° de réf. du vendeur V9780821835517
Quantité disponible : 1 disponible(s)
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Hardback. Etat : New. New copy - Usually dispatched within 4 working days. N° de réf. du vendeur B9780821835517
Quantité disponible : 2 disponible(s)
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
Hardcover. Etat : Like New. Like New .Ships From Multiple Locations. book. N° de réf. du vendeur ERICA79108218355136
Quantité disponible : 1 disponible(s)
Vendeur : Rarewaves.com UK, London, Royaume-Uni
Hardback. Etat : New. The intersection of combinatorics and statistical physics has experienced great activity in recent years. This flurry of activity has been fertilized by an exchange not only of techniques, but also of objectives. Computer scientists interested in approximation algorithms have helped statistical physicists and discrete mathematicians overcome language problems. They have found a wealth of common ground in probabilistic combinatorics. Close connections between percolation and random graphs, graph morphisms and hard-constraint models, and slow mixing and phase transition have led to new results and perspectives. These connections can help in understanding typical behavior of combinatorial phenomena such as graph coloring and homomorphisms. Inspired by issues and intriguing new questions surrounding the interplay of combinatorics and statistical physics, a DIMACS/DIMATIA workshop was held at Rutgers University. These proceedings are the outgrowth of that meeting. This volume is intended for graduate students and research mathematicians interested in probabilistic graph theory and its applications. N° de réf. du vendeur LU-9780821835517
Quantité disponible : 1 disponible(s)