|
Электронная библиотека механико-математического факультета Московского государственного университета
|
|
|
|
Результат поиска |
Поиск книг, содержащих: Catalan numbers
Книга | Страницы для поиска | Кормен Т., Лейзерсон Ч., Ривест Р. - Алгоритмы: построение и анализ | 253, 290 | Kedlaya K.S., Poonen B., Vakil R. - The William Lowell Putnam Mathematical Competition 1985-2000: Problems, Solutions, and Commentary | 206 | Engel A. - Problem-Solving Strategies | 99, 101 | Graham R.L., Grotschel M., Lovasz L. - Handbook of combinatorics (vol. 1) | 1033, 1034, 1990 | Grimaldi R.P. - Discrete and combinatorial mathematics. An introduction | 502, 504, 505, 507, 508, 522, 523 | Graham R.L., Knuth D.E., Patashnik O. - Concrete mathematics | 181, 203, 303 | Barbeau E.J. - Polynomials: a problem book | 262 | Lueneburg H. - Tools and fundamental constructions of combinatorial mathematics | 4U, 426 | Graham R.L., Grotschel M., Lovasz L. - Handbook of combinatorics (vol. 2) | 1033, 1034, 1990 | Clote P., Backofen R. - Computational Molecular Biology | 204 | Burton D.M. - Elementary Number Theory | 12 | Lando S.K., Zvonkin A.K. - Graphs on Surfaces and Their Applications | 154, 174, 186, 193, 210, 387 | Lozansky E., Rousseau C. - Winning Solutions | 146 | Goodman F.M., Harpe P. - Coxeter Graphs and Towers of Algebras | 2.7 | Comtet L. - Advanced Combinatorics. The Art of Finite and Infinate Expansions | 53, 53t, 74, 82 | Andreescu T., Feng Z. - Path to Combinatorics for Undergraduates: Counting Strategies | 82 | Anderson I. - A first course in discrete mathematics | 34, 37, 41 | Williamson S. - Combinatorics for computer science | 171 | Sloane N.J.A. - Handbook of Integer Sequences | 577 | Pickover C.A. - Wonders of Numbers: Adventures in Mathematics, Mind, and Meaning | 331-333 | Finch S.R. - Mathematical constants | 25 | Cover T.M., Gopinath B. - Open problems in communication and computation | 131-132 | Bolc L. - Natural language parsing systems | 280, 294, 297, 303ff, 307ff | Sedgewick R. - Algorithms | 487 | Kolman B., Busby R.C., Cutler S.C. - Discrete Mathematical Structures | 101, 174-175 | Guy R.K. - Unsolved Problems in Number theory | B33 | Bergeron F., Labelle G., Leroux P. - Combinatorial Species and Tree-like Structures | 163, 168, 252, 256, 291 | Ruskey F. - Combinatorial generation | 21 | D'Angelo J.P., West D.B. - Mathematical Thinking: Problem-Solving and Proofs | 173, 244, 5, 249, 54 | Bóna M. - A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory | 179, 311 | Conway J.H. - The Book of Numbers | 101 | Young R.M. - Excursions in Calculus: An Interplay of the Continuous and the Discrete | 259 | Charalambides C.A. - Enumerative Combinatorics | 81, 100, 196, 229 | Bona M. - Combinatorics of permutations | 133 | Bóna M. - Introduction to Enumerative Combinatorics | 27, 44, 151, 238, 284, 290 | Knuth D.E. - The art of computer programming (vol. 1 Fundаmental algorithms) | 407 | Gordon H. - Discrete Probability | (see $w_{0}, w_{1}$) | Fuchs D., Tabachnikov S. - Mathematical omnibus: Thirty lectures on classical mathematics | 42 | van Lint J.H., Wilson R.M. - Course in Combinatorics | 116-121, 130, 145 | Wilf H.S., Zeilbercer D., Petkovšek M. - A=B | 177 | Greene D.H., Knuth D.E. - Mathematics for the analysis of algorithms | 111-113 | Sofo A. - Computational Techniques for the Summation of Series | 118, 119 | Grimaldi R.P., Rothman D.J. - Discrete and Combinatorial Mathematics | 36-39, 361, 490-493, 506, 507, 586, 695, 696 | Benjamin A.T., Quinn J. - Proofs That Really Count The Art of Combinatorial Proof | 79 | Shen A. - Algorithms and Programming | 44, 48, 116 |
|
|
|
|
|