Based on a March 2001 workshop, this collection explores connections between random graphs and percolation, between slow mixing and phase transition, and between graph morphisms and hard-constraint models. Topics of the 14 papers include efficient local search near phase transitions in combinatorial optimization, graph homomorphisms and long range action, recent results on parameterized H-colorings, the satisfiability of random k-Horn formulae, a discrete non-Pfaffian approach to the Ising problem, and chromatic numbers of products of tournaments. No indexes are provided. Annotation �2004 Book News, Inc., Portland, OR (booknews.com)

"About this title" may belong to another edition of this title.

Store Description

Visit Seller's Storefront

Seller's business information

Bookmonger.Ltd
100 HOFFMAN PLACE, HILLSIDE, NJ, 07205, U.S.A.

Sale & Shipping Terms

Terms of Sale

Payment with order as per Abebooks policies
Bookmonger Ltd
100 Hoffman Place
Hillside NJ 07205 USA
bookmongerltd@comcast.net Tel 973-371-8810 Mark Adams
US EIN 161616342

Shipping Terms

Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.

Shipping rates within U.S.A.

Shipping rates within U.S.A.
Order quantity	5 to 14 business days	3 to 6 business days
First item	US$ 4.00	US$ 7.00

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.