Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Hardcover. 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.
hardcover. Zustand: Very Good.
hardcover. Zustand: 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!
Anbieter: Antiquariat Renner OHG, Albstadt, Deutschland
Verbandsmitglied: BOEV
Hardcover. Zustand: 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.
hardcover. Zustand: 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!
Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
Anbieter: ALLBOOKS1, Direk, SA, Australien
Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 94,09
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: Lucky's Textbooks, Dallas, TX, USA
EUR 94,77
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Jun 12, 2001. Zustand: gebraucht; wie neu. leichte Spuren, wie ungelesen.
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 112,27
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 101,99
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In English.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 105,33
Anzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 2nd reprint edition. 422 pages. 9.25x6.10x1.10 inches. In Stock.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 101,66
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Verlag: Springer Berlin Heidelberg, Springer Berlin Heidelberg, 2013
ISBN 10: 3642269907 ISBN 13: 9783642269905
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: 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.
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
EUR 116,93
Anzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Verlag: Springer-Verlag New York Inc, 2011
ISBN 10: 3642173632 ISBN 13: 9783642173639
Sprache: Englisch
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 143,61
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 2nd edition. 411 pages. 9.50x6.50x1.25 inches. In Stock.
Verlag: Springer Berlin Heidelberg, 2011
ISBN 10: 3642173632 ISBN 13: 9783642173639
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: 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.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 156,67
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
EUR 147,33
Anzahl: 1 verfügbar
In den WarenkorbHardcover. Zustand: Like New. Like New. book.
Verlag: Springer-Verlag New York Inc, 2011
ISBN 10: 3642173632 ISBN 13: 9783642173639
Sprache: Englisch
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 93,53
Anzahl: 1 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 2nd edition. 411 pages. 9.50x6.50x1.25 inches. In Stock. This item is printed on demand.
Anbieter: preigu, Osnabrück, Deutschland
Buch. Zustand: Neu. Extremal Combinatorics | With Applications in Computer Science | Stasys Jukna | Buch | xxiv | Englisch | 2011 | Springer-Verlag GmbH | EAN 9783642173639 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.