Idioma: Inglés
Publicado por Cambridge University Press, 2010
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: Greenworld Books, Arlington, TX, Estados Unidos de America
EUR 33,41
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: good. Fast Free Shipping â" Good condition. It may show normal signs of use, such as light writing, highlighting, or library markings, but all pages are intact and the book is fully readable. A solid, complete copy that's ready to enjoy.
Idioma: Inglés
Publicado por Cambridge University Press, 2003
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: Book Grocer, Tullamarine, VIC, Australia
EUR 25,37
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Giuliana Davidoff (Mount Holyoke College, Massachusetts), Cambridge University Press. This text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applications in computer science and engineering. The reader needs only a background in elementary algebra, analysis and combinatorics; the authors supply the necessary background material from graph theory, number theory, group theory and representation theory. The text can therefore be used as a brief introduction to these subjects as well as an illustration of how such topics are synthesised in modern mathematics. Paperback.
Idioma: Inglés
Publicado por Cambridge University Press, 2010
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 55,04
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Cambridge University Press, 2010
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 59,31
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Cambridge University Press, 2010
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 59,18
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Cambridge University Press, GB, 2003
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
EUR 62,51
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: New. This text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applications in computer science and engineering. The reader needs only a background in elementary algebra, analysis and combinatorics; the authors supply the necessary background material from graph theory, number theory, group theory and representation theory. The text can therefore be used as a brief introduction to these subjects as well as an illustration of how such topics are synthesised in modern mathematics.
Idioma: Inglés
Publicado por Cambridge University Press 2003-03, 2003
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: Chiron Media, Wallingford, Reino Unido
EUR 52,84
Cantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
Idioma: Inglés
Publicado por Cambridge University Press, 2010
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 59,32
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Idioma: Inglés
Publicado por Cambridge University Press, 2010
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 55,79
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Cambridge University Press, 2010
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 64,65
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Cambridge University Press CUP, 2010
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 81,61
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 156.
Idioma: Inglés
Publicado por Cambridge University Press, 2010
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 103,39
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. A self-contained treatment of expander graphs which are important in computer science, engineering and mathematics. Series: London Mathematical Society Student Texts. Num Pages: 156 pages, Illustrations. BIC Classification: PBG; PBH; PBV. Category: (P) Professional & Vocational. Dimension: 229 x 164 x 10. Weight in Grams: 254. . 2010. Illustrated. Paperback. . . . . Books ship from the US and Ireland.
Idioma: Inglés
Publicado por Cambridge University Press., 2003
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: Antiquariat Bernhardt, Kassel, Alemania
EUR 59,92
Cantidad disponible: 1 disponibles
Añadir al carritokartoniert kartoniert. Condición: Sehr gut. 144 Seiten, mit Abbildungen, Zust: Gutes Exemplar. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versenden mit der deutschen Post. Sprache: Englisch Gewicht in Gramm: 228.
Idioma: Inglés
Publicado por Cambridge University Press, 2003
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 119,94
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. A self-contained treatment of expander graphs which are important in computer science, engineering and mathematics. Series: London Mathematical Society Student Texts. Num Pages: 156 pages, Illustrations. BIC Classification: PBG; PBH; PBV. Category: (P) Professional & Vocational. Dimension: 229 x 164 x 10. Weight in Grams: 254. . 2010. Illustrated. Paperback. . . . .
Idioma: Inglés
Publicado por Cambridge University Press, GB, 2003
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: Rarewaves.com UK, London, Reino Unido
EUR 58,40
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: New. This text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applications in computer science and engineering. The reader needs only a background in elementary algebra, analysis and combinatorics; the authors supply the necessary background material from graph theory, number theory, group theory and representation theory. The text can therefore be used as a brief introduction to these subjects as well as an illustration of how such topics are synthesised in modern mathematics.
Idioma: Inglés
Publicado por Cambridge University Press, 2010
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 74,13
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This text is a self-contained study of expander graphs, specifically, their explicit construction. Expander graphs are highly connected but sparse, and while being of interest within combinatorics and graph theory, they can also be applied to computer science and engineering. Only a knowledge of elementary algebra, analysis and combinatorics is required because the authors provide the necessary background from graph theory, number theory, group theory and representation theory. Thus the text can be used as a brief introduction to these subjects and their synthesis in modern mathematics.
Idioma: Inglés
Publicado por Cambridge University Press, Cambridge, 2003
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
EUR 64,53
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: new. Paperback. This text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applications in computer science and engineering. The reader needs only a background in elementary algebra, analysis and combinatorics; the authors supply the necessary background material from graph theory, number theory, group theory and representation theory. The text can therefore be used as a brief introduction to these subjects as well as an illustration of how such topics are synthesised in modern mathematics. This text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applications in computer science and engineering. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 52,77
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Brand New. 144 pages. 8.75x6.00x0.50 inches. In Stock. This item is printed on demand.
Idioma: Inglés
Publicado por Cambridge University Press, 2010
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 58,10
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Idioma: Inglés
Publicado por Cambridge University Press, 2010
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: Majestic Books, Hounslow, Reino Unido
EUR 80,93
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 156 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam.
Idioma: Inglés
Publicado por Cambridge University Press, 2010
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 82,43
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 156.
Idioma: Inglés
Publicado por Cambridge University Press, Cambridge, 2003
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: CitiRetail, Stevenage, Reino Unido
EUR 64,92
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: new. Paperback. This text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applications in computer science and engineering. The reader needs only a background in elementary algebra, analysis and combinatorics; the authors supply the necessary background material from graph theory, number theory, group theory and representation theory. The text can therefore be used as a brief introduction to these subjects as well as an illustration of how such topics are synthesised in modern mathematics. This text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applications in computer science and engineering. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Idioma: Inglés
Publicado por Cambridge University Press, 2010
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: moluna, Greven, Alemania
EUR 61,08
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applicat.
Idioma: Inglés
Publicado por Cambridge University Press, Cambridge, 2003
ISBN 10: 0521531438 ISBN 13: 9780521531436
Librería: AussieBookSeller, Truganina, VIC, Australia
EUR 94,29
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: new. Paperback. This text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applications in computer science and engineering. The reader needs only a background in elementary algebra, analysis and combinatorics; the authors supply the necessary background material from graph theory, number theory, group theory and representation theory. The text can therefore be used as a brief introduction to these subjects as well as an illustration of how such topics are synthesised in modern mathematics. This text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applications in computer science and engineering. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.