Algebraic and Combinatorial Computational Biology, Robeva, Raina
Автор: Tshilidzi Marwala; Monica Lagazio Название: Militarized Conflict Modeling Using Computational Intelligence ISBN: 1447127013 ISBN-13(EAN): 9781447127017 Издательство: Springer Рейтинг: Цена: 121110.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This volume offers a scientific approach to manage inter-country conflict. Readers will find that through simultaneous control of four specific aspects (democracy, dependency, allies and capacity), predicted dispute outcomes can be avoided.
Автор: Ewald Название: Combinatorial convexity and algebraic geometry ISBN: 0387947558 ISBN-13(EAN): 9780387947556 Издательство: Springer Цена: 55850.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Presents an introduction to the theory of convex polytopes and polyhedral sets, to algebraic geometry, and to the connections between these fields, known as the theory of toric varieties. This book covers the theory of polytopes. It describes toric varieties in an elementary way.
Автор: Christian Reidys Название: Combinatorial Computational Biology of RNA ISBN: 1489981470 ISBN-13(EAN): 9781489981479 Издательство: Springer Рейтинг: Цена: 97820.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book brings together the author`s research in the study of RNA structures, presenting new combinatorics and combinatorial structures which enhance both mathematics and biology. The author produces pseudo knotted structures, providing an alternative approach.
Автор: Henri Cohen Название: A Course in Computational Algebraic Number Theory ISBN: 3642081428 ISBN-13(EAN): 9783642081422 Издательство: Springer Рейтинг: Цена: 60510.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: With the advent of powerful computing tools and numerous advances in math- ematics, computer science and cryptography, algorithmic number theory has become an important subject in its own right. Both external and internal pressures gave a powerful impetus to the development of more powerful al- gorithms. These in turn led to a large number of spectacular breakthroughs. To mention but a few, the LLL algorithm which has a wide range of appli- cations, including real world applications to integer programming, primality testing and factoring algorithms, sub-exponential class group and regulator algorithms, etc ... Several books exist which treat parts of this subject. (It is essentially impossible for an author to keep up with the rapid pace of progress in all areas of this subject.) Each book emphasizes a different area, corresponding to the author's tastes and interests. The most famous, but unfortunately the oldest, is Knuth's Art of Computer Programming, especially Chapter 4. The present book has two goals. First, to give a reasonably comprehensive introductory course in computational number theory. In particular, although we study some subjects in great detail, others are only mentioned, but with suitable pointers to the literature. Hence, we hope that this book can serve as a first course on the subject. A natural sequel would be to study more specialized subjects in the existing literature.
Автор: Frederic Eyssette; Andre Galligo Название: Computational Algebraic Geometry ISBN: 1461276527 ISBN-13(EAN): 9781461276524 Издательство: Springer Рейтинг: Цена: 74490.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: The theory and practice of computation in algebraic geometry and related domains, from a mathematical point of view, has generated an increasing interest both for its rich theoretical possibilities and its usefulness in applications in science and engineering. In fact, it is one of the master keys for future significant improvement of the computer algebra systems (e.g., Reduce, Macsyma, Maple, Mathematica, Axiom, Macaulay, etc.) that have become such useful tools for many scientists in a variety of disciplines. The major themes covered in this volume, arising from papers p- sented at the conference MEGA-92 were: - Effective methods and complexity issues in commutative algebra, projective geometry, real geometry, and algebraic number theory - Algebra-geometric methods in algebraic computing and applica- tions. MEGA-92 was the second of a new series of European conferences on the general theme of Effective Methods in Algebraic Geometry. It was held in Nice, France, on April 21-25, 1992 and built on the themes presented at MEGA-90 (Livomo, Italy, April 17-21, 1990). The next conference - MEGA-94 - will be held in Santander, Spain in the spring of 1994. The Organizing committee that initiatiod and supervises this bi- enniel conference consists of A. Conte (Torino), J. H. Davenport (Bath), A. Galligo (Nice), D. Yu. Grigoriev (Petersburg), J. Heintz (Buenos Aires), W. Lassner (Leipzig), D. Lazard (paris), H. M. MOller (Hagen), T. Mora (Genova), M. Pohst (DUsseldort), T. Recio (Santander), J. J.
Автор: Aldo Conca; Sandra Di Rocco; Jan Draisma; June Huh Название: Combinatorial Algebraic Geometry ISBN: 3319048694 ISBN-13(EAN): 9783319048697 Издательство: Springer Рейтинг: Цена: 41920.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Combinatorics and Algebraic Geometry have enjoyed a fruitful interplay since the nineteenth century. The aim of this volume is to introduce recent developments in combinatorial algebraic geometry and to approach algebraic geometry with a view towards applications, such as tensor calculus and algebraic statistics.
Автор: I.A. Faradzev; A.A. Ivanov; M. Klin; A.J. Woldar Название: Investigations in Algebraic Theory of Combinatorial Objects ISBN: 9048141958 ISBN-13(EAN): 9789048141951 Издательство: Springer Рейтинг: Цена: 130430.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: X Kochendorffer, L.A. Kalu: lnin and their students in the 50s and 60s. Nowadays the most deeply developed is the theory of binary invariant relations and their combinatorial approximations. These combinatorial approximations arose repeatedly during this century under various names (Hecke algebras, centralizer rings, association schemes, coherent configurations, cellular rings, etc.-see the first paper of the collection for details) andin various branches of mathematics, both pure and applied. One of these approximations, the theory of cellular rings (cellular algebras), was developed at the end of the 60s by B. Yu. Weisfeiler and A.A. Leman in the course of the first serious attempt to study the complexity of the graph isomorphism problem, one of the central problems in the modern theory of combinatorial algorithms. At roughly the same time G.M. Adelson-Velskir, V.L. Arlazarov, I.A. Faradtev and their colleagues had developed a rather efficient tool for the constructive enumeration of combinatorial objects based on the branch and bound method. By means of this tool a number of "sports-like" results were obtained. Some of these results are still unsurpassed.
Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2) ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
