Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics, Frank G. Garvan; Mourad E.H. Ismail

Автор: Flajolet
Название: Analytic Combinatorics
ISBN: 0521898064 ISBN-13(EAN): 9780521898065
Издательство: Cambridge Academ
Рейтинг:
Цена: 88710.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The definitive treatment of analytic combinatorics. This self-contained text covers the mathematics underlying the analysis of discrete structures, with thorough treatment of a large number of applications. Exercises, examples, appendices and notes aid understanding: ideal for individual self-study or for advanced undergraduate or graduate courses.

Автор: Harris, John Hirst, Jeffry L. Mossinghoff, Michael
Название: Combinatorics and graph theory
ISBN: 0387797106 ISBN-13(EAN): 9780387797106
Издательство: Springer
Рейтинг:
Цена: 38150.00 T
Наличие на складе: Есть в Астана (Нур-Султан)
Описание: Covers a wide variety of topics in combinatorics and graph theory. This book includes results and problems that cross subdisciplines, emphasizing relationships between different areas of mathematics. It also includes sections in graph theory on distance, Eulerian trails, and hamiltonian paths.

Автор: Korte, Bernhard, Vygen, Jens
Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.
ISBN: 3642244874 ISBN-13(EAN): 9783642244872
Издательство: Springer
Рейтинг:
Цена: 60510.00 T
Наличие на складе: Невозможна поставка.
Описание: This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.

Автор: Alexander Barvinok
Название: Combinatorics and Complexity of Partition Functions
ISBN: 3319518283 ISBN-13(EAN): 9783319518282
Издательство: Springer
Рейтинг:
Цена: 71730.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: V.A. Malyshev; A.M. Vershik
Название: Asymptotic Combinatorics with Application to Mathematical Physics
ISBN: 1402007930 ISBN-13(EAN): 9781402007934
Издательство: Springer
Рейтинг:
Цена: 130430.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Proceedings of the NATO Advanced Study Institute, held in St.Petersburg, Russia, 9-22 July 2001

Автор: V.A. Malyshev; A.M. Vershik
Название: Asymptotic Combinatorics with Application to Mathematical Physics
ISBN: 1402007922 ISBN-13(EAN): 9781402007927
Издательство: Springer
Рейтинг:
Цена: 153720.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Proceedings of the NATO Advanced Study Institute, held in St.Petersburg, Russia, 9-22 July 2001

Автор: V. Bryant
Название: Independence Theory in Combinatorics
ISBN: 0412224305 ISBN-13(EAN): 9780412224300
Издательство: Springer
Рейтинг:
Цена: 81050.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Combinatorics may very loosely be described as that branch of mathematics which is concerned with the problems of arranging objects in accordance with various imposed constraints.

Автор: S. B. Rao
Название: Combinatorics and Graph Theory
ISBN: 3540111514 ISBN-13(EAN): 9783540111511
Издательство: Springer
Рейтинг:
Цена: 46540.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Bolian Liu; Hong-Jian Lai
Название: Matrices in Combinatorics and Graph Theory
ISBN: 1441948341 ISBN-13(EAN): 9781441948342
Издательство: Springer
Рейтинг:
Цена: 153720.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Combinatorics and Matrix Theory have a symbiotic, or mutually beneficial, relationship. where an attempt was made to give a broad picture of the use of combinatorial ideas in matrix theory and the use of matrix theory in proving theorems which, at least on the surface, are combinatorial in nature.

Автор: Martin Charles Golumbic; Irith Ben-Arroyo Hartman
Название: Graph Theory, Combinatorics and Algorithms
ISBN: 1441937234 ISBN-13(EAN): 9781441937230
Издательство: Springer
Рейтинг:
Цена: 121110.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering.

Автор: Fred Roberts
Название: Applications of Combinatorics and Graph Theory to the Biological and Social Sciences
ISBN: 1468463837 ISBN-13(EAN): 9781468463835
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This IMA Volume in Mathematics and its Applications Applications of Combinatorics and Graph Theory to the Biological and Social Sciences is based on the proceedings of a workshop which was an integral part of the 1987-88 IMA program on APPLIED COMBINATORICS.

Автор: Rainer Bodendiek; Rudolf Henn
Название: Topics in Combinatorics and Graph Theory
ISBN: 3642469108 ISBN-13(EAN): 9783642469107
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book, which grew out of contributions given by about 130 authors in honour to the 70th birthday of Gerhard Ringel, one of the pioneers in graph theory, is meant to serve as a source of open problems, reference and guide to the extensive literature and as stimulant to further research on graph theory and combinatorics.