Stable Marriage and Its Relation to Other Combinatorial Problems

Donald E. Knuth

7 valoraciones de Goodreads

Idioma: inglés

Editorial: American Mathematical Society, US, 1996

0821806033 / 9780821806036

  • Tapa blanda
  • Nuevo
Ver todos los detalles
Imagen del artículo 1 de 3.

Librería: Rarewaves.com USA, London, London, Reino UnidoRarewaves.com USA

Vendedor de 5 estrellas

Vendedor de IberLibro desde 11 de junio de 2025

Tapa blanda

Condición: Nuevo

EUR 36,13

 Gastos de envío gratis 
Se envía de Reino Unido a Estados Unidos de America

Cantidad disponible: 2 disponibles

Añadir al carrito
Devoluciones gratuitas de 30 días

Descripción del artículo del vendedor

'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

Título
Stable Marriage and Its Relation to Other Combinatorial Problems
Autor
Donald E. Knuth
Editorial
American Mathematical Society, US
Año de publicación
1996
Estado
New
Encuadernación
Paperback
Idioma
inglés
ISBN 10
0821806033
ISBN 13
9780821806036
Peso del artículo
175 gramos
Dimensiones
18.42 x 0.64 x 26.04 cm

Rarewaves.com USA

London, London, Reino Unido

Vendedor de 5 estrellas

Vendedor de IberLibro desde 11 de junio de 2025

Tarifas de envío de Reino Unido a Estados Unidos de America

ArtículoDe 10 a 15 días hábilesDe 10 a 15 días hábiles
Primer artículoEUR 0,00EUR 0,00
Los plazos de entrega los establecen los vendedores y varían según el transportista y la ubicación. Los pedidos que pasan por la aduana pueden sufrir retrasos y los compradores son responsables de los aranceles o tarifas asociadas. Los vendedores pueden ponerse en contacto con usted en relación con cargos adicionales para cubrir cualquier aumento en los costes de envío de los artículos.

Métodos de pago

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay

Información empresarial del vendedor

RAREWAVES.COM LIMITED

Elsley Court, 20-22 Great Titchfield Street
London, Reino Unido W1W 8BE