Combinatorics: Ancient & Modern, Wilson, Robin; Watkins, John J.

Автор: 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.

Автор: Tao, Terence Vu, Van H.
Название: Additive combinatorics
ISBN: 0521136563 ISBN-13(EAN): 9780521136563
Издательство: Cambridge Academ
Рейтинг:
Цена: 60190.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The many different tools from different fields that are used in additive combinatorics are brought together in a self-contained and systematic manner. This graduate-level 2006 text will quickly allow students and researchers easy entry into the fascinating field of additive combinatorics.

Автор: 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.

Автор: Wilson Robin
Название: Combinatorics: A Very Short Introduction
ISBN: 0198723490 ISBN-13(EAN): 9780198723493
Издательство: Oxford Academ
Рейтинг:
Цена: 10550.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Combinatorics is a large branch of mathematics involving the counting, selecting, and arranging of objects. Robin Wilson explores the field, looking at problems such as the shortest routes from A to B, to the number of Sudoku puzzles possible.

Автор: 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.