Articoli correlati a Stable Marriage and Its Relation to Other Combinatorial...
Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms - Brossura
Sinossi
'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 science 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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Recensione
This short book will provide extremely enjoyable reading to anyone with an interest in discrete mathematics and algorithm design. Mathematical Reviews
Anyone would enjoy reading this book. If one had to learn French first, it would be worth the effort. Computing Reviews
Product Description
Book by Donald Ervin Knuth
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 30,45
EUR 2,00 per la spedizione da Irlanda a Italia
Destinazione, tempi e costiRisultati della ricerca per Stable Marriage and Its Relation to Other Combinatorial...
Immagini fornite dal venditore
Stable Marriage and Its Relation to Other Combinatorial Problems (CRM Proceedings & Lecture Notes): An Introduction to the Mathematical Analysis of Algorithms
Editore:
American Mathematical Society, 1996
ISBN 10: 0821806033
ISBN 13: 9780821806036
Antico o usato
Brossura
Da: WeBuyBooks, Rossendale, LANCS, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: Like New. Most items will be dispatched the same or the next working day. An apparently unread copy in perfect condition. Dust cover is intact with no nicks or tears. Spine has no signs of creasing. Pages are clean and not marred by notes or folds of any kind. Codice articolo wbs2939138829
Quantità: 1 disponibili
Foto dell'editore
Stable Marriage and Its Relation to Other Combinatorial Problems
Editore:
American Mathematical Society, 1996
ISBN 10: 0821806033
ISBN 13: 9780821806036
Antico o usato
Brossura
Da: Better World Books, Mishawaka, IN, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Very Good. Used book that is in excellent condition. May show signs of wear or have minor defects. Codice articolo 50931465-6
Quantità: 1 disponibili
Foto dell'editore
Stable Marriage and Its Relation to Other Combinatorial Problems (CRM Proceedings & Lecture Notes)
Editore:
American Mathematical Society 99/c /05 D, 1996
ISBN 10: 0821806033
ISBN 13: 9780821806036
Antico o usato
Paperback
Da: Bahamut Media, Reading, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Very Good. Shipped within 24 hours from our UK warehouse. Clean, undamaged book with no damage to pages and minimal wear to the cover. Spine still tight, in very good condition. Remember if you are not happy, you are covered by our 100% money back guarantee. Codice articolo 6545-9780821806036
Quantità: 1 disponibili
Foto dell'editore
Stable Marriage and Its Relation to Other Combinatorial Problems (CRM Proceedings & Lecture Notes)
Editore:
American Mathematical Society 05 D, 1996
ISBN 10: 0821806033
ISBN 13: 9780821806036
Antico o usato
Paperback
Da: AwesomeBooks, Wallingford, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Very Good. Stable Marriage and Its Relation to Other Combinatorial Problems (CRM Proceedings & Lecture Notes) This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping. . Codice articolo 7719-9780821806036
Quantità: 1 disponibili
Foto dell'editore
Stable Marriage and Its Relation to Other Combinatorial Problems
Editore:
American Mathematical Society, 1996
ISBN 10: 0821806033
ISBN 13: 9780821806036
Nuovo
Brossura
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Valutazione del venditore 5 su 5 stelle
Condizione: New. 1996. annotated edition. Paperback. 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. . . . . . Codice articolo V9780821806036
Quantità: 1 disponibili
Immagini fornite dal venditore
Stable Marriage and Its Relation to Other Combinatorial Problems
Editore:
American Mathematical Society, US, 1996
ISBN 10: 0821806033
ISBN 13: 9780821806036
Nuovo
Paperback
Da: Rarewaves.com UK, London, Regno Unito
Valutazione del venditore 5 su 5 stelle
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 science 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. Codice articolo LU-9780821806036
Quantità: 3 disponibili
Immagini fornite dal venditore
Stable Marriage and Its Relation to Other Combinatorial Problems
Editore:
American Mathematical Society, US, 1996
ISBN 10: 0821806033
ISBN 13: 9780821806036
Nuovo
Paperback
Da: Rarewaves.com USA, London, LONDO, Regno Unito
Valutazione del venditore 5 su 5 stelle
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 science 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. Codice articolo LU-9780821806036
Quantità: 3 disponibili
Foto dell'editore
Stable Marriage and Its Relation to Other Combinatorial Problems
Editore:
American Mathematical Society, 1996
ISBN 10: 0821806033
ISBN 13: 9780821806036
Nuovo
Brossura
Da: Kennys Bookstore, Olney, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. 1996. annotated edition. Paperback. 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. . . . . . Books ship from the US and Ireland. Codice articolo V9780821806036
Quantità: 1 disponibili
Foto dell'editore
Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms (Crm Proceedings and Lecture Notes)
Editore:
Amer Mathematical Society, 1996
ISBN 10: 0821806033
ISBN 13: 9780821806036
Antico o usato
Brossura
Da: SecondSale, Montgomery, IL, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc. Codice articolo 00091193722
Quantità: 1 disponibili
Foto dell'editore
Stable Marriage and Its Relation to Other Combinatorial Problems
Editore:
American Mathematical Society, 1996
ISBN 10: 0821806033
ISBN 13: 9780821806036
Nuovo
Paperback / softback
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days. 199. Codice articolo B9780821806036
Quantità: 5 disponibili