Artículos relacionados 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 (CRM Proceedings & Lecture Notes) - Tapa blanda
Sinopsis
'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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Acerca del autor
Charlotte y Peter Fiell son dos autoridades en historia, teoría y crítica del diseño y han escrito más de sesenta libros sobre la materia, muchos de los cuales se han convertido en éxitos de ventas. También han impartido conferencias y cursos como profesores invitados, han comisariado exposiciones y asesorado a fabricantes, museos, salas de subastas y grandes coleccionistas privados de todo el mundo. Los Fiell han escrito numerosos libros para TASCHEN, entre los que se incluyen 1000 Chairs, Diseño del siglo XX, El diseño industrial de la A a la Z, Scandinavian Design y Diseño del siglo XXI.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 32,69
EUR 2,25 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoResultados de la búsqueda para Stable Marriage and Its Relation to Other Combinatorial...
Imagen de archivo
Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms (Crm Proceedings and Lecture Notes)
Publicado por
Amer Mathematical Society, 1996
ISBN 10: 0821806033
ISBN 13: 9780821806036
Antiguo o usado
Tapa blanda
Librería: SecondSale, Montgomery, IL, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc. Nº de ref. del artículo: 00091193722
Cantidad disponible: 1 disponibles
Imagen de archivo
Stable Marriage and Its Relation to Other Combinatorial Problems
Publicado por
American Mathematical Society, 1996
ISBN 10: 0821806033
ISBN 13: 9780821806036
Antiguo o usado
Tapa blanda
Librería: Better World Books, Mishawaka, IN, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: Very Good. Used book that is in excellent condition. May show signs of wear or have minor defects. Nº de ref. del artículo: 50931465-6
Cantidad disponible: 1 disponibles
Imagen del vendedor
Stable Marriage and Its Relation to Other Combinatorial Problems (CRM Proceedings & Lecture Notes): An Introduction to the Mathematical Analysis of Algorithms
Publicado por
American Mathematical Society, 1996
ISBN 10: 0821806033
ISBN 13: 9780821806036
Antiguo o usado
Tapa blanda
Librería: WeBuyBooks, Rossendale, LANCS, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: 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. Nº de ref. del artículo: wbs2939138829
Gastos de envío:
EUR 4,37
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles
Imagen de archivo
Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms (Crm Proceedings and Lecture Notes, 10)
Publicado por
Amer Mathematical Society, 1996
ISBN 10: 0821806033
ISBN 13: 9780821806036
Antiguo o usado
paperback
Librería: Book Alley, Pasadena, CA, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
paperback. Condición: Very Good. Gently used, no markings. Nº de ref. del artículo: mon0000682984
Cantidad disponible: 1 disponibles
Imagen de archivo
Stable Marriage and Its Relation to Other Combinatorial Problems (CRM Proceedings & Lecture Notes)
Publicado por
American Mathematical Society 05 D, 1996
ISBN 10: 0821806033
ISBN 13: 9780821806036
Antiguo o usado
Paperback
Librería: AwesomeBooks, Wallingford, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: 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. . Nº de ref. del artículo: 7719-9780821806036
Gastos de envío:
EUR 5,75
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles
Imagen de archivo
Stable Marriage and Its Relation to Other Combinatorial Problems (CRM Proceedings & Lecture Notes)
Publicado por
American Mathematical Society 99/c /05 D, 1996
ISBN 10: 0821806033
ISBN 13: 9780821806036
Antiguo o usado
Paperback
Librería: Bahamut Media, Reading, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: 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. Nº de ref. del artículo: 6545-9780821806036
Gastos de envío:
EUR 8,04
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles
Imagen de archivo
Stable Marriage and Its Relation to Other Combinatorial Problems : An Introduction to the Mathematical Analysis of Algorithms
Publicado por
Amer Mathematical Society, 1996
ISBN 10: 0821806033
ISBN 13: 9780821806036
Nuevo
Tapa blanda
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 6019906-n
Cantidad disponible: 1 disponibles
Imagen del vendedor
Stable Marriage and Its Relation to Other Combinatorial Problems
Publicado por
American Mathematical Society, US, 1996
ISBN 10: 0821806033
ISBN 13: 9780821806036
Nuevo
Paperback
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: 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. Nº de ref. del artículo: LU-9780821806036
Gastos de envío:
GRATIS
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 3 disponibles
Imagen de archivo
Stable Marriage and Its Relation to Other Combinatorial Problems : An Introduction to the Mathematical Analysis of Algorithms
Publicado por
Amer Mathematical Society, 1996
ISBN 10: 0821806033
ISBN 13: 9780821806036
Antiguo o usado
Tapa blanda
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 6019906
Cantidad disponible: 1 disponibles
Imagen de archivo
Stable Marriage and Its Relation to Other Combinatorial Problems
Publicado por
American Mathematical Society, 1996
ISBN 10: 0821806033
ISBN 13: 9780821806036
Nuevo
Tapa blanda
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Calificación del vendedor: 5 de 5 estrellas
Condición: 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. . . . . . Nº de ref. del artículo: V9780821806036
Gastos de envío:
EUR 10,50
De Irlanda a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles