Stable Marriage and Its Relation to Other Combinatorial Problems

Donald E. Knuth

7 valutazioni di Goodreads

Lingua: inglese

Editore: American Mathematical Society, US, 1996

0821806033 / 9780821806036

Immagine dell’articolo 1 di 3

Da: Rarewaves.com USA, London, London, Regno UnitoRarewaves.com USA

Venditore con 5 stelle

Venditore AbeBooks dal 11 giugno 2025

Brossura

Condizione: Nuovo

EUR 36,38

 Spedizione gratuita 
Spedito da Regno Unito a U.S.A.

Quantità: 2 disponibili

Aggiungi al carrello
Resi gratuiti per 30 giorni

Descrizione dell’articolo da parte del venditore

'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

Titolo
Stable Marriage and Its Relation to Other Combinatorial Problems
Autore
Donald E. Knuth
Editore
American Mathematical Society, US
Anno di pubblicazione
1996
Condizione
New
Rilegatura
Paperback
Lingua
inglese
ISBN 10
0821806033
ISBN 13
9780821806036
Peso dell'articolo
175 grammi
Dimensioni
18.42 x 0.64 x 26.04 cm

Rarewaves.com USA

London, London, Regno Unito

Venditore con 5 stelle

Venditore AbeBooks dal 11 giugno 2025

Tariffe di spedizione da Regno Unito a U.S.A.

ArticoloDa 10 a 15 giorni lavorativiDa 10 a 15 giorni lavorativi
Primo articoloEUR 0,00EUR 0,00
I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.

Metodi di pagamento

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

Informazioni sull’azienda del venditore

RAREWAVES.COM LIMITED

Elsley Court, 20-22 Great Titchfield Street
London, Regno Unito W1W 8BE