Additive combinatorics, Bajnok, Bela (gettysburg College, Usa)
Автор: Tao, Terence Vu, Van H. Название: Additive combinatorics ISBN: 0521136563 ISBN-13(EAN): 9780521136563 Издательство: Cambridge Academ Рейтинг: Цена: 9436 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Описание: 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.
Автор: Tao Jiang; D.T. Lee Название: Computing and Combinatorics ISBN: 354063357X ISBN-13(EAN): 9783540633570 Издательство: Springer Рейтинг: Цена: 13774 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The proceedings of the Third Annual International Conference on Computing and Combinatorics, COCOON `97. The papers in this volume are organized in sections which include parallel and distributed computing, computational geometry, complexity, computation biology, and computability.
Автор: Louis Comtet Название: Advanced Combinatorics ISBN: 9401021988 ISBN-13(EAN): 9789401021982 Издательство: Springer Рейтинг: Цена: 13315 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The true beginnings of combinatorial analysis (also called combina- tory analysis) coincide with the beginnings of probability theory in the 17th century. Today, combinatorial analysis is also relevant to problems of existence, estimation and structuration, like all other parts of mathema- tics, but exclusively forjinite sets.
Автор: Baik Jinho Название: Combinatorics and Random Matrix Theory ISBN: 0821848410 ISBN-13(EAN): 9780821848418 Издательство: Turpin Рейтинг: Цена: 14391 р. Наличие на складе: Невозможна поставка.
Описание: The goal of this book is to analyse in detail Ulam`s problem for increasing subsequences of random permutations, and domino tilings of the Aztec diamond. Other examples are also described along the way, but in less detail. The book is self-contained, and develops enough of the theory from each area that a general reader can learn the subject directly from the text.
Описание: Featuring up-to-date coverage of three topics lying at the intersection of combinatorics and commutative algebra, namely Koszul algebras, primary decompositions and subdivision operations in simplicial complexes, this book has its focus on computations.
Описание: Proceedings of the NATO Advanced Study Institute, held in St.Petersburg, Russia, 9-22 July 2001
Автор: Ernesto Damiani; Ottavio D`Antona; Vincenzo Marra; Название: From Combinatorics to Philosophy ISBN: 1489982981 ISBN-13(EAN): 9781489982988 Издательство: Springer Рейтинг: Цена: 27550 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Rota`s legacy connects European and Italian research communities to the USA by providing inspiration to several generations of researchers in combinatorics, philosophy and computer science.From Combinatorics to Philosophy: The Legacy of G.
Автор: Wang Название: Computing and Combinatorics ISBN: 3319947753 ISBN-13(EAN): 9783319947754 Издательство: Springer Рейтинг: Цена: 7652 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the proceedings of the 24th International Conference on Computing and Combinatorics, COCOON 2018, held in Qing Dao, China, in July 2018. They deal with the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing.
Автор: Daniel Krob; Alexander A. Mikhalev; Alexander V. M Название: Formal Power Series and Algebraic Combinatorics ISBN: 3540672478 ISBN-13(EAN): 9783540672470 Издательство: Springer Рейтинг: Цена: 36583 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: SFCA/FPSAC (Series Formelles et Combinatoire Algebrique/Formal Power Se- ries and Algebraic Combinatorics) is a series of international conferences that are held annually since 1988, alternating between Europe and North America. They usually take place at the end of the academic year, between June and July depending on the local organizing constraints. SFCA/FPSAC has now become one of the most important annual inter- national meetings for the algebraic and bijective combinatorics community. The conference is indeed one of the key international exchange place of ideas between all researchers involved in this emerging exciting area. SFCA/FPSAC'OO is the 12th in the series. It will take place in Moscow (Russia) from June 26 to June 30, 2000. Previous SFCA/FPSAC conferences were organized in Lille (88), Paris (90), Bordeaux (91), Montreal (92), Florence (93), Rutgers (94), Marne-la-Vallee (95), Minneapolis (96), Vienna (97), Toronto (98) and Barcelona (99). SFCA/FPSAC'OO is co-organized by the Center of New Information Tech- nologies (CNIT) of Moscow State University, the Laboratoire d'Informatique AI- gorithmique: Fondements et Applications (LIAFA) of University Paris 7 and the Maison de l'Informatique et des Mathematiques Discretes (MIMD). The SFCA/FPSAC'OO conference covers all main areas of algebraic combi- natorics and bijective combinatorics (including asymptotic analysis, all sorts of enumeration, representation theory of classical groups and classical Lie algebras, symmetric functions, etc). A special stress was also put this year on combinato- rial and computer algebra.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
