Computing and Combinatorics, Ding-Zhu Du; Guochuan Zhang
Автор: Flajolet Название: Analytic Combinatorics ISBN: 0521898064 ISBN-13(EAN): 9780521898065 Издательство: Cambridge Academ Рейтинг: Цена: 13306.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Jin-Yi Cai; C.K. Wong Название: Computing and Combinatorics ISBN: 3540613323 ISBN-13(EAN): 9783540613329 Издательство: Springer Рейтинг: Цена: 12157.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Dinh Название: Computing and Combinatorics ISBN: 3319426338 ISBN-13(EAN): 9783319426334 Издательство: Springer Рейтинг: Цена: 11460.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 22nd International Conference on Computing and Combinatorics, COCOON 2016, held in Ho Chi Minh City, Vietnam, in August 2016. The papers cover various topics including: Theory and Algorithms; Parameterized Complexity and Algorithms; Scheduling Algorithms and Circuit Complexity;
Автор: Dachuan Xu; Donglei Du; Dingzhu Du Название: Computing and Combinatorics ISBN: 3319213970 ISBN-13(EAN): 9783319213972 Издательство: Springer Рейтинг: Цена: 12298.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 21st International Conference on Computing and Combinatorics, COCOON 2015, held in Beijing, China, in August 2015. database theory, computational biology and bioinformatics; computational algebra, geometry, number theory, graph drawing and information visualization;
Автор: Martin Charles Golumbic; Irith Ben-Arroyo Hartman Название: Graph Theory, Combinatorics and Algorithms ISBN: 1441937234 ISBN-13(EAN): 9781441937230 Издательство: Springer Рейтинг: Цена: 18167.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Bolian Liu; Hong-Jian Lai Название: Matrices in Combinatorics and Graph Theory ISBN: 1441948341 ISBN-13(EAN): 9781441948342 Издательство: Springer Рейтинг: Цена: 23058.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Oscar H. Ibarra; Louxin Zhang Название: Computing and Combinatorics ISBN: 354043996X ISBN-13(EAN): 9783540439967 Издательство: Springer Рейтинг: Цена: 16070.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: These are the refereed proceedings of the 8th Annual International Computing and Combinatorics Conference, COCOON 2002, held in Singapore in August 2002.
Автор: Tao Jiang; D.T. Lee Название: Computing and Combinatorics ISBN: 354063357X ISBN-13(EAN): 9783540633570 Издательство: Springer Рейтинг: Цена: 12577.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Zhipeng Cai; Alexander Zelikovsky; Anu Bourgeois Название: Computing and Combinatorics ISBN: 3319087827 ISBN-13(EAN): 9783319087825 Издательство: Springer Рейтинг: Цена: 12298.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 20th International Conference on Computing and Combinatorics, COCOON 2014, held in Atlanta, GA, USA, in August 2014. There was a co-organized workshop on computational social networks (CSoNet 2014) where 8 papers were accepted. scheduling algorithms and circuit complexity and CSoNet.
Автор: Xiao-Xin Du; Hu Guoding Название: Combinatorics, Computing and Complexity ISBN: 0792303083 ISBN-13(EAN): 9780792303084 Издательство: Springer Рейтинг: Цена: 13275.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Louis Comtet Название: Advanced Combinatorics ISBN: 9401021988 ISBN-13(EAN): 9789401021982 Издательство: Springer Рейтинг: Цена: 12157.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Daniel Krob; Alexander A. Mikhalev; Alexander V. M Название: Formal Power Series and Algebraic Combinatorics ISBN: 3642086624 ISBN-13(EAN): 9783642086625 Издательство: Springer Рейтинг: Цена: 33401.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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