Da: Antiquariat Bookfarm, Löbnitz, Germania
EUR 38,90
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloHardcover. 375 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. AD6117 9783540663133 Sprache: Englisch Gewicht in Gramm: 550.
Da: HPB-Red, Dallas, TX, U.S.A.
EUR 55,23
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrellohardcover. Condizione: 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!
EUR 56,27
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrellohardcover. Condizione: 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!
EUR 28,00
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Wie neu. Bln., Springer (2001). gr.8°. 36 figs. XVII, 375 p. Hardbound. Texts in Theoretical Computer Science. An EATCS Series.- With 315 Exercises.- Like new.
Da: ALLBOOKS1, Direk, SA, Australia
EUR 78,65
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
Da: ALLBOOKS1, Direk, SA, Australia
EUR 79,44
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 94,06
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 92,89
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: online-buch-de, Dozwil, Svizzera
EUR 62,18
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCondizione: gebraucht; wie neu. leichte Spuren, wie ungelesen.
Da: California Books, Miami, FL, U.S.A.
EUR 104,62
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 110,05
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 102,84
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In English.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 102,53
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 113,89
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Revaluation Books, Exeter, Regno Unito
EUR 103,97
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 2nd reprint edition. 422 pages. 9.25x6.10x1.10 inches. In Stock.
Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg, 2013
ISBN 10: 3642269907 ISBN 13: 9783642269905
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 69,54
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is a concise, self-contained, up-to-date introduction to extremal combinatorics for nonspecialists. There is a strong emphasis on theorems with particularly elegant and informative proofs, they may be called gems of the theory. The author presents a wide spectrum of the most powerful combinatorial tools together with impressive applications in computer science: methods of extremal set theory, the linear algebra method, the probabilistic method, and fragments of Ramsey theory. No special knowledge in combinatorics or computer science is assumed - the text is self-contained and the proofs can be enjoyed by undergraduate students in mathematics and computer science. Over 300 exercises of varying difficulty, and hints to their solution, complete the text.This second edition has been extended with substantial new material, and has been revised and updated throughout. It offers three new chapters on expander graphs and eigenvalues, the polynomial method and error-correcting codes. Most of the remaining chapters also include new material, such as the Kruskal-Katona theorem on shadows, the Lovász-Stein theorem on coverings, large cliques in dense graphs without induced 4-cycles, a new lower bounds argument for monotone formulas, Dvir's solution of the finite field Kakeya conjecture, Moser's algorithmic version of the Lovász Local Lemma, Schöning's algorithm for 3-SAT, the Szemerédi-Trotter theorem on the number of point-line incidences, surprising applications of expander graphs in extremal number theory, and some other new results.
Editore: Springer Berlin Heidelberg, 2011
ISBN 10: 3642173632 ISBN 13: 9783642173639
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 96,29
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is a concise, self-contained, up-to-date introduction to extremal combinatorics for nonspecialists. There is a strong emphasis on theorems with particularly elegant and informative proofs, they may be called gems of the theory. The author presents a wide spectrum of the most powerful combinatorial tools together with impressive applications in computer science: methods of extremal set theory, the linear algebra method, the probabilistic method, and fragments of Ramsey theory. No special knowledge in combinatorics or computer science is assumed - the text is self-contained and the proofs can be enjoyed by undergraduate students in mathematics and computer science. Over 300 exercises of varying difficulty, and hints to their solution, complete the text.This second edition has been extended with substantial new material, and has been revised and updated throughout. It offers three new chapters on expander graphs and eigenvalues, the polynomial method and error-correcting codes. Most of the remaining chapters also include new material, such as the Kruskal-Katona theorem on shadows, the Lovász-Stein theorem on coverings, large cliques in dense graphs without induced 4-cycles, a new lower bounds argument for monotone formulas, Dvir's solution of the finite field Kakeya conjecture, Moser's algorithmic version of the Lovász Local Lemma, Schöning's algorithm for 3-SAT, the Szemerédi-Trotter theorem on the number of point-line incidences, surprising applications of expander graphs in extremal number theory, and some other new results.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 136,76
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Like New. Like New. book.
Editore: Springer-Verlag New York Inc, 2011
ISBN 10: 3642173632 ISBN 13: 9783642173639
Lingua: Inglese
Da: Revaluation Books, Exeter, Regno Unito
EUR 141,02
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 2nd edition. 411 pages. 9.50x6.50x1.25 inches. In Stock.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 148,55
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Like New. Like New. book.
Editore: Springer-Verlag New York Inc, 2011
ISBN 10: 3642173632 ISBN 13: 9783642173639
Lingua: Inglese
Da: Revaluation Books, Exeter, Regno Unito
EUR 94,31
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 2nd edition. 411 pages. 9.50x6.50x1.25 inches. In Stock. This item is printed on demand.