9780821806036 - stable marriage and its relation to other combinatorial problems: an introduction to the mathematical analysis of algorithms di knuth, donald e. (12 risultati)
- Brossura
Da: Silent Way Books, Glenside, PA, U.S.A.Silent Way Books
Contatta il venditoreVenditore con 4 stelleCondizione: Usato - Molto buono
EUR 13,26
EUR 4,26 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Trade Paperback. Condizione: Near Very Good. Pages tight and unmarked; minor shelf wear to wraps.
- Brossura
Da: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 29,50
EUR 4,00 spedizioneSpedito da Italia a U.S.A.Quantità: 3 disponibili
Condizione: new.
Altre immagini- Brossura
Da: Rarewaves.com USA, London, LONDO, Regno UnitoRarewaves.com USA
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 34,85
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Paperback. Condizione: New. 'This is a very stimulating book!' - N. G. de Bruijn. 'This short book will provide extremely enjoyable reading to anyone with an interest in discrete mathematics and algorithm design' - ""Mathematical Reviews"". 'This book is an excellent (and enjoyable) means of sketching a large area of computer sc…ience for specialists in other fields: It requires little previous knowledge, but expects of the reader a degree of mathematical facility and a willingness to participate. It is really neither a survey nor an introduction; rather, it is a paradigm, a fairly complete treatment of a single example used as a synopsis of a larger subject' - ""SIGACT News"". 'Anyone would enjoy reading this book. If one had to learn French first, it would be worth the effort!' - ""Computing Reviews"". The above citations are taken from reviews of the initial French version of this text - a series of seven expository lectures that were given at the University of Montreal in November of 1975.The book uses the appealing theory of stable marriage to introduce and illustrate a variety of important concepts and techniques of computer science and mathematics: data structures, control structures, combinatorics, probability, analysis, algebra, and especially the analysis of algorithms. The presentation is elementary, and the topics are interesting to nonspecialists. The theory is quite beautiful and developing rapidly. Exercises with answers, an annotated bibliography, and research problems are included.The text would be appropriate as supplementary reading for undergraduate research seminars or courses in algorithmic analysis and for graduate courses in combinatorial algorithms, operations research, economics, or analysis of algorithms. Donald E. Knuth is one of the most prominent figures of modern computer science. His works in ""The Art of Computer Programming"" are classic. He is also renowned for his development of TeX and METAFONT. In 1996, Knuth won the prestigious Kyoto Prize, considered to be the nearest equivalent to a Nobel Prize in computer science.
- Brossura
Da: WorldofBooks, Goring-By-Sea, WS, Regno UnitoWorldofBooks
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Molto buono
EUR 31,21
EUR 6,52 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.
- Brossura
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandaKennys Bookshop and Art Galleries Ltd.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 31,34
EUR 9,50 spedizioneSpedito da Irlanda a U.S.A.Quantità: 1 disponibili
Condizione: New. Uses the theory of stable marriage to introduce and illustrate a variety of important concepts and techniques of computer science and mathematics: data structures, control structures, combinatorics, probability, analysis, algebra, and especially the analysis of algorithms. Series: CRM Proceedings & Lecture Notes…. Num Pages: 74 pages, Illustrations. BIC Classification: PBV. Category: (P) Professional & Vocational. Dimension: 253 x 181 x 6. Weight in Grams: 172. . 1996. annotated edition. Paperback. . . . .
- Brossura
Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 38,36
EUR 3,83 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 3 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Brossura
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 32,35
EUR 11,64 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: Brand New. annotated edition edition. 74 pages. 10.25x7.25x0.25 inches. In Stock.
- Brossura
Da: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 38,39
EUR 9,04 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Condizione: New. Uses the theory of stable marriage to introduce and illustrate a variety of important concepts and techniques of computer science and mathematics: data structures, control structures, combinatorics, probability, analysis, algebra, and especially the analysis of algorithms. Series: CRM Proceedings & Lecture Notes…. Num Pages: 74 pages, Illustrations. BIC Classification: PBV. Category: (P) Professional & Vocational. Dimension: 253 x 181 x 6. Weight in Grams: 172. . 1996. annotated edition. Paperback. . . . . Books ship from the US and Ireland.
- Brossura
Da: Books Puddle, New York, NY, U.S.A.Books Puddle
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 45,21
EUR 3,44 spedizioneSpedito in U.S.A.Quantità: 3 disponibili
Condizione: New. pp. 74.
- Brossura
Da: THE SAINT BOOKSTORE, Southport, Regno UnitoTHE SAINT BOOKSTORE
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 37,72
EUR 14,83 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 3 disponibili
Paperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days.
- Brossura
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 42,27
EUR 13,94 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 3 disponibili
Condizione: New. In English.
Altre immagini- Brossura
Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 34,03
EUR 75,65 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Paperback. Condizione: New. 'This is a very stimulating book!' - N. G. de Bruijn. 'This short book will provide extremely enjoyable reading to anyone with an interest in discrete mathematics and algorithm design' - ""Mathematical Reviews"". 'This book is an excellent (and enjoyable) means of sketching a large area of computer sc…ience for specialists in other fields: It requires little previous knowledge, but expects of the reader a degree of mathematical facility and a willingness to participate. It is really neither a survey nor an introduction; rather, it is a paradigm, a fairly complete treatment of a single example used as a synopsis of a larger subject' - ""SIGACT News"". 'Anyone would enjoy reading this book. If one had to learn French first, it would be worth the effort!' - ""Computing Reviews"". The above citations are taken from reviews of the initial French version of this text - a series of seven expository lectures that were given at the University of Montreal in November of 1975.The book uses the appealing theory of stable marriage to introduce and illustrate a variety of important concepts and techniques of computer science and mathematics: data structures, control structures, combinatorics, probability, analysis, algebra, and especially the analysis of algorithms. The presentation is elementary, and the topics are interesting to nonspecialists. The theory is quite beautiful and developing rapidly. Exercises with answers, an annotated bibliography, and research problems are included.The text would be appropriate as supplementary reading for undergraduate research seminars or courses in algorithmic analysis and for graduate courses in combinatorial algorithms, operations research, economics, or analysis of algorithms. Donald E. Knuth is one of the most prominent figures of modern computer science. His works in ""The Art of Computer Programming"" are classic. He is also renowned for his development of TeX and METAFONT. In 1996, Knuth won the prestigious Kyoto Prize, considered to be the nearest equivalent to a Nobel Prize in computer science.
