Computing and Combinatorics, Tao Jiang; D.T. Lee

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

Автор: H. Crapo; D. Senato
Название: Algebraic Combinatorics and Computer Science
ISBN: 8847021596 ISBN-13(EAN): 9788847021594
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book, dedicated to the memory of Gian-Carlo Rota, is the result of a collaborative effort by his friends, students and admirers. The book opens with a heartfelt piece by Henry Crapo in which he meticulously pieces together what Gian-Carlo Rota`s untimely demise has bequeathed to science.

Автор: Bruce A. Reed; Claudia L. Linhares-Sales
Название: Recent Advances in Algorithms and Combinatorics
ISBN: 1468492683 ISBN-13(EAN): 9781468492682
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Excellent authors, such as Lovasz, one of the five best combinatorialists in the world; Thematic linking that makes it a coherent collection; Will appeal to a variety of communities, such as mathematics, computer science and operations research

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

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

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

Автор: Jin-Yi Cai; C.K. Wong
Название: Computing and Combinatorics
ISBN: 3540613323 ISBN-13(EAN): 9783540613329
Издательство: Springer
Рейтинг:
Цена: 81050.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume constitutes the proceedings of the Second Annual International Conference on Computing and Combinatorics. The 44 papers, presented in revised version, describe current research results from various areas of theoretical computer science and combinatorics related to computing.

Автор: Ding-Zhu Du; Guochuan Zhang
Название: Computing and Combinatorics
ISBN: 3642387675 ISBN-13(EAN): 9783642387678
Издательство: Springer
Рейтинг:
Цена: 46570.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: There was a co-organized workshop on discrete algorithms of which 8 short papers were accepted and a workshop on computational social networks where 12 papers out of 25 submissions were accepted.

Автор: Hung Q. Ngo
Название: Computing and Combinatorics
ISBN: 3642028810 ISBN-13(EAN): 9783642028816
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 15th Annual International Conference COCOON 2009 Niagara Falls NY USA July 1315 2009 Proceedings. .

Автор: Xiao-Xin Du; Hu Guoding
Название: Combinatorics, Computing and Complexity
ISBN: 0792303083 ISBN-13(EAN): 9780792303084
Издательство: Springer
Рейтинг:
Цена: 88500.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: One service mathematics has rendered the 'Et moi, ..., si j'avait su comment en revenir, It has put common sense back je n'y serais point al e.' human race. Jules Verne where it belongs, on the topmost shelf next to the dusty canister labelled 'discarded n- sense'. The series is divergent; therefore we may be able to do something with it. Eric T. Bell o. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and non- linearities abound. Similarly, all kinds of parts of mathematics serve as tools for other parts and for other sciences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One service topology has rendered mathematical physics .. .'; 'One service logic has rendered com- puterscience .. .'; 'One service category theory has rendered mathematics .. .'. All arguably true. And all statements obtainable this way form part of the raison d'etre of this series.

Автор: Oscar H. Ibarra; Louxin Zhang
Название: Computing and Combinatorics
ISBN: 354043996X ISBN-13(EAN): 9783540439967
Издательство: Springer
Рейтинг:
Цена: 107130.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: These are the refereed proceedings of the 8th Annual International Computing and Combinatorics Conference, COCOON 2002, held in Singapore in August 2002.

Автор: Daniel Krob; Alexander A. Mikhalev; Alexander V. M
Название: Formal Power Series and Algebraic Combinatorics
ISBN: 3540672478 ISBN-13(EAN): 9783540672470
Издательство: Springer
Рейтинг:
Цена: 222670.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.