Moore cristopher (80 résultats)

Paperback. Etat : Very Good. El Angel Mas Tonto del Mundo This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping. .…

Paperback. Etat : Very Good. Shipped within 24 hours from our UK warehouse. Clean, undamaged book with no damage to pages and minimal wear to the cover. Spine still tight, in very good condition. Remember if you are not happy, you are covered by our 100% money back guarantee.

Paperback. Etat : Very Good. Shelf wear of the cover. No writing or highlighting in the text. Very good reader's copy.

Soft cover. Etat : New. New book, never read. Pages clean and crisp, spine unbroken. 0223B.

Softcover. Etat : New. No Jacket. First Edition. Brand New! The covers look great. The binding is tight. The interior pages are clean and unmarked. Electronic delivery tracking will be issued free of charge.

Paperback. Etat : Used: Very Good. 1st ed. Softcover, 340pp, vg. Two copies.

Etat : good. All pages and cover are intact. Dust jacket included if applicable, though it may be missing on hardcover editions. Spine and cover may show minor signs of wear including scuff marks, curls or bends to corners as well as cosmetic blemishes including stickers. Pages may contain limited notes or highlighting. "From the library of" labels may be present. Shrink wrap, dust covers, or boxed set packaging may be missing. Bundled media e.g., CDs, DVDs, access codes may not be included.…

paperback. Etat : Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Etat : Good. [ No Hassle 30 Day Returns ][ Ships Daily ] [ Underlining/Highlighting: NONE ] [ Writing: NONE ] [ Edition: Reprint ] Publisher: Oxford Pub Date: 1/1/2003 Binding: Hardcover Pages: 340 Reprint edition.

Paperback. Etat : Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Soft cover. Etat : Fine.

Etat : As New. Unread book in perfect condition.

Soft cover. Etat : As New. Unused copy.

paperback. Etat : Gut. 340 Seiten; 9780195137187.3 Gewicht in Gramm: 1.

Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Etat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Etat : New.

Hardback. Etat : Good. Computational complexity is one of the most beautiful fields of modern mathematics, and it is increasingly relevant to other sciences ranging from physics to biology. But this beauty is often buried underneath layers of unnecessary formalism, and exciting recent results like interactive proofs, phase transitions, and quantum computing are usually considered too advanced for the typical student. This book bridges these gaps by explaining the deep ideas of theoretical computer science in a clear and enjoyable fashion, making them accessible to non-computer scientists and to computer scientists who finally want to appreciate their field from a new point of view. The authors start with a lucid and playful explanation of the P vs. NP problem, explaining why it is so fundamental, and so hard to resolve. They then lead the reader through the complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and the outer reaches of quantum computing. At every turn, they use a minimum of formalism, providing explanations that are both deep and accessible. The book is intended for graduate and undergraduate students, scientists from other areas who have long wanted to understand this subject, and experts who want to fall in love with this field all over again.…

Hardcover. Etat : Very Good. 1. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Hardcover. Etat : New. 1. The item is brand new, never used or read. It's in perfect condition and may include supplements and/or access codes or come shrink-wrapped.

Etat : Used.

Hardcover. Etat : New. 1st Edition. New book, never read. Pages clean and crisp, spine unbroken. 0223A.

Hardback. Etat : Good. Computational complexity is one of the most beautiful fields of modern mathematics, and it is increasingly relevant to other sciences ranging from physics to biology. But this beauty is often buried underneath layers of unnecessary formalism, and exciting recent results like interactive proofs, phase transitions, and quantum computing are usually considered too advanced for the typical student. This book bridges these gaps by explaining the deep ideas of theoretical computer science in a clear and enjoyable fashion, making them accessible to non-computer scientists and to computer scientists who finally want to appreciate their field from a new point of view. The authors start with a lucid and playful explanation of the P vs. NP problem, explaining why it is so fundamental, and so hard to resolve. They then lead the reader through the complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and the outer reaches of quantum computing. At every turn, they use a minimum of formalism, providing explanations that are both deep and accessible. The book is intended for graduate and undergraduate students, scientists from other areas who have long wanted to understand this subject, and experts who want to fall in love with this field all over again.…

No binding. Etat : Good. Book in Good condition.

Etat : Used.

Etat : Used.

Etat : New. Computer science and physics have been closely linked since the birth of modern computing. This book serves as a standard reference and pedagogical aid to statistical physics methods in computer science, with a particular focus on phase transitions in combinatorial problems. It is useful for students and researchers. Editor(s): Percus, Allon; Istrate, Gabriel; Moore, Cristopher. Series: Santa Fe Institute Studies on the Sciences of Complexity. Num Pages: 384 pages, Numerous line drawings. BIC Classification: PBW; PHS. Category: (P) Professional & Vocational. Dimension: 158 x 234 x 24. Weight in Grams: 580. . 2006. Illustrated. paperback. . . . .…

Etat : New.

Paperback / softback. Etat : New. New copy - Usually dispatched within 4 working days.

Etat : New. In English.