9783642173639 - extremal combinatorics: with applications in computer science di jukna, stasys (20 risultati)
Lingua: Inglese
Editore: Springer 2011
Serie: Texts in Theoretical Computer Science. An EATCS, Libro 33 di 45. Libro 33 di 45 - Texts in Theoretical Computer Science. An EATCS
- Rilegato
Da: Books From California, Simi Valley, CA, U.S.A.Books From California
Contatta il venditoreVenditore con 4 stelleCondizione: Usato - Molto buono
EUR 53,87
EUR 4,31 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
hardcover. Condizione: Very Good.
Lingua: Inglese
Editore: Springer 2011
Serie: Texts in Theoretical Computer Science. An EATCS, Libro 33 di 45. Libro 33 di 45 - Texts in Theoretical Computer Science. An EATCS
- Rilegato
Da: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand
Contatta il venditoreVenditore con 3 stelleCondizione: Nuovo
EUR 86,24
EUR 8,00 spedizioneSpedito da Italia a U.S.A.Quantità: 5 disponibili
Condizione: new.
Lingua: Inglese
Editore: Springer 2011
Serie: Texts in Theoretical Computer Science. An EATCS, Libro 33 di 45. Libro 33 di 45 - Texts in Theoretical Computer Science. An EATCS
- Rilegato
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 96,89
EUR 2,28 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
Lingua: Inglese
Editore: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin 2011
Serie: Texts in Theoretical Computer Science. An EATCS, Libro 33 di 45. Libro 33 di 45 - Texts in Theoretical Computer Science. An EATCS
- Rilegato
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 99,25
Spedizione gratuitaSpedito in U.S.A.Quantità: 1 disponibili
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 power…ful 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 2011
Serie: Texts in Theoretical Computer Science. An EATCS, Libro 33 di 45. Libro 33 di 45 - Texts in Theoretical Computer Science. An EATCS
- Rilegato
Da: Brook Bookstore, Milano, MI, ItaliaBrook Bookstore
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 81,51
EUR 27,99 spedizioneSpedito da Italia a U.S.A.Quantità: 5 disponibili
Condizione: new.
Lingua: Inglese
Editore: Springer 2011
Serie: Texts in Theoretical Computer Science. An EATCS, Libro 33 di 45. Libro 33 di 45 - Texts in Theoretical Computer Science. An EATCS
- Rilegato
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 99,37
EUR 17,38 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
Lingua: Inglese
Editore: Springer 2011
Serie: Texts in Theoretical Computer Science. An EATCS, Libro 33 di 45. Libro 33 di 45 - Texts in Theoretical Computer Science. An EATCS
- Rilegato
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 103,42
EUR 13,88 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In English.
Lingua: Inglese
Editore: Springer 2011
Serie: Texts in Theoretical Computer Science. An EATCS, Libro 33 di 45. Libro 33 di 45 - Texts in Theoretical Computer Science. An EATCS
- Rilegato
Da: Books Puddle, New York, NY, U.S.A.Books Puddle
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 148,42
EUR 3,45 spedizioneSpedito in U.S.A.Quantità: 4 disponibili
Condizione: New. pp. 436 2nd Edition.
Lingua: Inglese
Editore: Springer-Verlag New York Inc 2011
Serie: Texts in Theoretical Computer Science. An EATCS, Libro 33 di 45. Libro 33 di 45 - Texts in Theoretical Computer Science. An EATCS
- Rilegato
Da: Revaluation Books, Exeter, , Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 156,77
EUR 14,49 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Hardcover. Condizione: Brand New. 2nd edition. 411 pages. 9.50x6.50x1.25 inches. In Stock.
Lingua: Inglese
Editore: Springer, Springer 2011
Serie: Texts in Theoretical Computer Science. An EATCS, Libro 33 di 45. Libro 33 di 45 - Texts in Theoretical Computer Science. An EATCS
- Rilegato
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 106,99
EUR 64,08 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Buch. 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 prese…nts 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.
Lingua: Inglese
Editore: Springer 2011
Serie: Texts in Theoretical Computer Science. An EATCS, Libro 33 di 45. Libro 33 di 45 - Texts in Theoretical Computer Science. An EATCS
- Rilegato
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 159,94
EUR 17,38 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Springer 2011
Serie: Texts in Theoretical Computer Science. An EATCS, Libro 33 di 45. Libro 33 di 45 - Texts in Theoretical Computer Science. An EATCS
- Rilegato
Da: Mispah books, Redhill, SURRE, Regno UnitoMispah books
Contatta il venditoreVenditore con 4 stelleCondizione: Usato - Come nuovo
EUR 150,40
EUR 28,97 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Hardcover. Condizione: Like New. Like New. book.
Lingua: Inglese
Editore: Springer 2011
Serie: Texts in Theoretical Computer Science. An EATCS, Libro 33 di 45. Libro 33 di 45 - Texts in Theoretical Computer Science. An EATCS
- Rilegato
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 182,40
EUR 2,28 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin 2011
Serie: Texts in Theoretical Computer Science. An EATCS, Libro 33 di 45. Libro 33 di 45 - Texts in Theoretical Computer Science. An EATCS
- Rilegato
Da: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 161,59
EUR 31,97 spedizioneSpedito da Australia a U.S.A.Quantità: 1 disponibili
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 power…ful 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 our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Lingua: Inglese
Editore: Springer-Verlag New York Inc 2011
Serie: Texts in Theoretical Computer Science. An EATCS, Libro 33 di 45. Libro 33 di 45 - Texts in Theoretical Computer Science. An EATCS
- Rilegato
- Print on Demand
Da: Revaluation Books, Exeter, , Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 95,48
EUR 14,49 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Hardcover. Condizione: Brand New. 2nd edition. 411 pages. 9.50x6.50x1.25 inches. In Stock. This item is printed on demand.
Lingua: Inglese
Editore: Springer, Springer Sep 2011 2011
Serie: Texts in Theoretical Computer Science. An EATCS, Libro 33 di 45. Libro 33 di 45 - Texts in Theoretical Computer Science. An EATCS
- Rilegato
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, , GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 106,99
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 436 pp. Englisch.
Lingua: Inglese
Editore: Springer Berlin Heidelberg 2011
Serie: Texts in Theoretical Computer Science. An EATCS, Libro 33 di 45. Libro 33 di 45 - Texts in Theoretical Computer Science. An EATCS
- Rilegato
- Print on Demand
Da: moluna, Greven, , Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 89,99
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A concise, self-contained, up-to-date introduction to extremal combinatorics for nonspecialistsNo special combinatorial or algebraic background is assumed, all necessary elements of linear algebra and discrete probab…ility are introducedThe .
Lingua: Inglese
Editore: Springer 2011
Serie: Texts in Theoretical Computer Science. An EATCS, Libro 33 di 45. Libro 33 di 45 - Texts in Theoretical Computer Science. An EATCS
- Rilegato
- Print on Demand
Da: Majestic Books, Hounslow, , Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 152,19
EUR 7,53 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Condizione: New. Print on Demand pp. 436 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
Lingua: Inglese
Editore: Springer 2011
Serie: Texts in Theoretical Computer Science. An EATCS, Libro 33 di 45. Libro 33 di 45 - Texts in Theoretical Computer Science. An EATCS
- Rilegato
- Print on Demand
Da: Biblios, frankfurt am main, HESSE, GermaniaBiblios
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 151,70
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 4 disponibili
Condizione: New. PRINT ON DEMAND pp. 436.
Lingua: Inglese
Editore: Springer, Springer Sep 2011 2011
Serie: Texts in Theoretical Computer Science. An EATCS, Libro 33 di 45. Libro 33 di 45 - Texts in Theoretical Computer Science. An EATCS
- Rilegato
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 106,99
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 436 pp. Englisch.
