Stable Marriage and Its Relation to Other Combinatorial...

Main
Mathematics
Stable Marriage and Its Relation to...

Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms

Name: Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms
ISBN: 9780821806036

Donald Ervin Knuth

0 / 0

0 comments

이 책이 얼마나 마음에 드셨습니까?

파일의 품질이 어떻습니까?

책의 품질을 평가하시려면 책을 다운로드하시기 바랍니다

다운로드된 파일들의 품질이 어떻습니까?

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.

카테고리:

Mathematics

년:

1996

판:

annotated edition

출판사:

Amer Mathematical Society

언어:

english

페이지:

ISBN 10: