書誌事項

Notes on introductory combinatorics

George Pólya, Robert E. Tarjan, Donald R. Woods

(Progress in computer science, no. 4)

Birkhäuser, 1983

  • : us
  • : us : pbk
  • : sz
  • : sz : pbk

大学図書館所蔵 件 / 51

この図書・雑誌をさがす

注記

Bibliography: p. [191]

内容説明・目次

巻冊次

: us ISBN 9780817631239

内容説明

"This is a delightful little paperback which presents a day-by-day transcription of a course taught jointly by Polya and Tarjan at Stanford University...One can count on [Polya and Tarjan] for new insights and a fresh outlook. Both instructors taught by presenting a succession of examples rather than by presenting a body of theory...[The book] is very well suited as supplementary material for any introductory class on combinatorics; as such, it is very highly recommended. Finally, for all of us who like the topic and delight in observing skilled professionals at work, this book is entertaining and, yes, instructive, reading." Mathematical Reviews (Review of the original hardcover edition) "The mathematical community welcomes this book as a final contribution to honour the teacher G. Polya." Zentralblatt MATH (Review of the original hardcover edition)"
巻冊次

: us : pbk ISBN 9780817631703

内容説明

In the winter of 1978, Professor George P61ya and I jointly taught Stanford University's introductory combinatorics course. This was a great opportunity for me, as I had known of Professor P61ya since having read his classic book, How to Solve It, as a teenager. Working with P6lya, who *was over ninety years old at the time, was every bit as rewarding as I had hoped it would be. His creativity, intelligence, warmth and generosity of spirit, and wonderful gift for teaching continue to be an inspiration to me. Combinatorics is one of the branches of mathematics that play a crucial role in computer sCience, since digital computers manipulate discrete, finite objects. Combinatorics impinges on computing in two ways. First, the properties of graphs and other combinatorial objects lead directly to algorithms for solving graph-theoretic problems, which have widespread application in non-numerical as well as in numerical computing. Second, combinatorial methods provide many analytical tools that can be used for determining the worst-case and expected performance of computer algorithms. A knowledge of combinatorics will serve the computer scientist well. Combinatorics can be classified into three types: enumerative, eXistential, and constructive. Enumerative combinatorics deals with the counting of combinatorial objects. Existential combinatorics studies the existence or nonexistence of combinatorial configurations.

目次

1. Introduction.- 2. Combinations and Permutations.- 3. Generating Functions.- 4. Principle of Inclusion and Exclusion.- 5. Stirling Numbers.- 6. Polya's Theory of Counting.- 7. Outlook.- 8. Midterm Examination.- 9. Ramsey Theory.- 10. Matchings (Stable Marriages).- 11. Matchings (Maximum Matchings).- 12. Network Flow.- 13. Hamiltonian and Eulerian Paths.- 14. Planarity and the Four-Color Theorem.- 15. Final Examination.- 16. Bibliography.

「Nielsen BookData」 より

関連文献: 1件中  1-1を表示

詳細情報

  • NII書誌ID(NCID)
    BA00521845
  • ISBN
    • 0817631232
    • 0817631704
    • 3764331232
    • 3764331704
  • LCCN
    83015790
  • 出版国コード
    us
  • タイトル言語コード
    eng
  • 本文言語コード
    eng
  • 出版地
    Boston ; Basel
  • ページ数/冊数
    190, [1] p.
  • 大きさ
    24 cm
  • 分類
  • 件名
  • 親書誌ID
ページトップへ