hardcover. Condizione: Very Good.
Hardcover. Condizione: Good. No Jacket. Former library book; Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condizione: 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.
hardcover. Condizione: Acceptable. Connecting readers with great books since 1972. Used textbooks may not include companion materials such as access codes, etc. May have condition issues including wear and notes/highlighting. We ship orders daily and Customer Service is our top priority!
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 54,42
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: SMASS Sellers, IRVING, TX, U.S.A.
Condizione: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
Da: SMASS Sellers, IRVING, TX, U.S.A.
Condizione: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
EUR 28,00
Quantità: 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: Revaluation Books, Exeter, Regno Unito
EUR 69,39
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 138 pages. 9.25x6.10x0.30 inches. In Stock.
Da: Gebrauchtbücherlogistik H.J. Lauterbach, Gummersbach, NRW, Germania
Prima edizione
EUR 12,83
Quantità: 1 disponibili
Aggiungi al carrelloBroschiert. Condizione: Gut. 1. Aufl. 24cm; Erste Auflage, XII, 315 S. Broschiert. graph. Darst. Zustand: Gut bis Sehr Gut min. gebräunt (Innen); Einband (Außen) hat geringe Gebrauchsspuren; * Die Photos sind original von uns erstellt worden, u.a. erkennbar an einem kleinen weißen Stück Papier im oberen Schnitt. Ab und an verwenden Suchmaschinen Verlagsphotos, bei den Portalen selbst, werden aber nur unsere Originalphotos gezeigt.
Lingua: Tedesco
Editore: Springer Fachmedien Wiesbaden, Weisbaden, 2007
ISBN 10: 3835102168 ISBN 13: 9783835102163
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condizione: new. Paperback. Studierende, die ein Informatikstudium aufnehmen, brauchen zu Beginn vor allem eines: mathematische Grundkenntnisse. Dieser Crashkurs soll Studierenden im ersten Semester helfen, moeglichst rechtzeitig diese Faehigkeiten zu erwerben.Durch viele motivierende Beispiele, erklaerende Bilder und konkrete Darstellungen weckt das Buch Freude an der Mathematik und sichert den erfolgreichen Einstieg. Studierende, die ein Informatikstudium aufnehmen, brauchen zu Beginn vor allem eines: mathematische Grundkenntnisse. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
EUR 43,08
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: medimops, Berlin, Germania
EUR 73,97
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: good. Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present.
Da: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 86,24
Quantità: 5 disponibili
Aggiungi al carrelloCondizione: new.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 97,30
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2011
ISBN 10: 3642173632 ISBN 13: 9783642173639
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condizione: new. Hardcover. 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 KruskalKatona theorem on shadows, the LovaszStein 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 Lovasz Local Lemma, Schoening's algorithm for 3-SAT, the SzemerediTrotter theorem on the number of point-line incidences, surprising applications of expander graphs in extremal number theory, and some other new results. Extremal Combinatorics provides a concise, up-to-date introduction to extremal combinatorics for nonspecialists. The text emphasizes theorems with particularly elegant and informative proofs, and presents a wide range of combinatorial tools. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Lingua: Inglese
Editore: Springer International Publishing, 2023
ISBN 10: 3031423534 ISBN 13: 9783031423536
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 48,14
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book presents an enticing introduction to tropical circuits and their use as a rigorous mathematical model for dynamic programming (DP), which is one of the most fundamental algorithmic paradigms for solving combinatorial, discrete optimization problems.In DP, an optimization problem is broken up into smaller subproblems that are solved recursively. Many classical DP algorithms are pure in that they only use the basic (min,+) or (max,+) operations in their recursion equations. In tropical circuits, these operations are used as gates. Thanks to the rigorous combinatorial nature of tropical circuits, elements from the Boolean and arithmetic circuit complexity can be used to obtain lower bounds for tropical circuits, which play a crucial role in understanding the limitations and capabilities of these computational models. This book aims to offer a toolbox for proving lower bounds on the size of tropical circuits.In this work, the reader will find lower-bound ideas and methods that have emerged in the last few years, with detailed proofs. Largely self-contained, this book is meant to be approachable by graduate students in mathematics and computer science with a special interest in circuit complexity.
Da: Brook Bookstore, Milano, MI, Italia
EUR 81,51
Quantità: 5 disponibili
Aggiungi al carrelloCondizione: new.
Da: online-buch-de, Dozwil, Svizzera
EUR 75,04
Quantità: 1 disponibili
Aggiungi al carrelloJun 12, 2001. Condizione: gebraucht; wie neu. leichte Spuren, wie ungelesen.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 99,33
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 103,21
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In English.
EUR 45,85
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Tropical Circuit Complexity | Limits of Pure Dynamic Programming | Stasys Jukna | Taschenbuch | SpringerBriefs in Mathematics | ix | Englisch | 2023 | Springer | EAN 9783031423536 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. xvi + 620 Index.
Da: Revaluation Books, Exeter, Regno Unito
EUR 119,01
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 2nd reprint edition. 422 pages. 9.25x6.10x1.10 inches. In Stock.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 42,21
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: preigu, Osnabrück, Germania
EUR 68,25
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Extremal Combinatorics | With Applications in Computer Science | Stasys Jukna | Taschenbuch | Texts in Theoretical Computer Science. An EATCS Series | xxiv | Englisch | 2013 | Springer | EAN 9783642269905 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 74,89
Quantità: 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.
Da: Revaluation Books, Exeter, Regno Unito
EUR 132,87
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 2012 edition. 620 pages. 9.00x6.10x1.30 inches. In Stock.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 119,13
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 436 2nd Edition.