Applied combinatorial mathematics / authors, George Pólya ... [et al.] ; editor, Edwin F. Beckenbach.
Editor: Malabar, Fla. : R. E. Krieger, 1981, c1964Descripción: xxi, 608 p. : il. ; 24 cmISBN: 0898741726Tema(s): Combinatorial analysis | Electronic digital computersOtra clasificación: 05-06Pt. 1A, Computation and evaluation: 1. The machine tools of combinatorics / Derrick H. Lehmer2. Techniques for simplifying logical networks / Montgomery Phister, Jr.Pt. 1B, Counting and enumeration: 3. Generating functions / John Riordan4. Lattice statistics / Elliott W. Montroll5. Pólya's theory of counting / N. G. de Bruijn6. Combinatorial problems in graphical enumeration / Frank HararyPt. 2, Control and extremization: 7. Dynamic programming and Markovian decision processes, with particular application to baseball and chess / Richard Bellman8. Graph theory and automatic control / Robert Kalaba9. Optimum multivariable control / Edwin L. Peterson10. Stopping-rule problems / Leo Breiman11. Combinatorial algebra of matrix games and linear programs / Albert W. Tucker12. Network flow problems / Edwin F. BeckenbachPt. 3, Construction and existence: 13. Block designs / Marshall Hall, Jr.14. Introduction to information theory / Jacob Wolfowitz15. Sperner's lemma and some extensions / Charles B. Tompkins16. Crystallography / Kenneth N. Trueblood17. Combinatorial principles in genetics / George Gamow18. Appendices / Hermann Weyl.
| Item type | Home library | Shelving location | Call number | Materials specified | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
Libros
|
Instituto de Matemática, CONICET-UNS | Libros ordenados por tema | 05 Ap652-2 (Browse shelf) | Available | A-5361 |
Browsing Instituto de Matemática, CONICET-UNS shelves, Shelving location: Libros ordenados por tema Close shelf browser
| 05 An613-3 New directions in the theory of graphs / | 05 Ap646 Every planar map is four colorable / | 05 Ap652 Applied combinatorial mathematics / | 05 Ap652-2 Applied combinatorial mathematics / | 05 Ap6525 Applications of graph theory / | 05 B241 Techniques ordinales en analyse des données. | 05 B285 Trees and proximity representations / |
Basado en la Statewide Lecture Series on Applied Combinatorial Mathematics, ofrecida por University Extension, Engineering and Physical Sciences Divisions, University of California, en 1962.
Reimpresión. Publicado originalmente: New York : Wiley, c1964. (University of California engineering and physical sciences extension series).
Incluye referencias bibliográficas.
Pt. 1A, Computation and evaluation: 1. The machine tools of combinatorics / Derrick H. Lehmer -- 2. Techniques for simplifying logical networks / Montgomery Phister, Jr. -- Pt. 1B, Counting and enumeration: 3. Generating functions / John Riordan -- 4. Lattice statistics / Elliott W. Montroll -- 5. Pólya's theory of counting / N. G. de Bruijn -- 6. Combinatorial problems in graphical enumeration / Frank Harary -- Pt. 2, Control and extremization: 7. Dynamic programming and Markovian decision processes, with particular application to baseball and chess / Richard Bellman -- 8. Graph theory and automatic control / Robert Kalaba -- 9. Optimum multivariable control / Edwin L. Peterson -- 10. Stopping-rule problems / Leo Breiman -- 11. Combinatorial algebra of matrix games and linear programs / Albert W. Tucker -- 12. Network flow problems / Edwin F. Beckenbach -- Pt. 3, Construction and existence: 13. Block designs / Marshall Hall, Jr. -- 14. Introduction to information theory / Jacob Wolfowitz -- 15. Sperner's lemma and some extensions / Charles B. Tompkins -- 16. Crystallography / Kenneth N. Trueblood -- 17. Combinatorial principles in genetics / George Gamow -- 18. Appendices / Hermann Weyl.
MR, 30 #4687 (ed. original)
Click on an image to view it in the image viewer
There are no comments on this title.