Algorithmic and Computer Methods for Three-Manifolds, A.T. Fomenko; S.V. Matveev
Автор: Terzidis Название: Algorithmic Architecture ISBN: 0750667257 ISBN-13(EAN): 9780750667258 Издательство: Taylor&Francis Рейтинг: Цена: 8573.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Why does the word design owe its origin to Latin and not Greek roots? Where do the limits of the human mind lie? This volume challenges the reader to tackle these complex questions and more. It presents many, various and often seemingly disparate points of view that lead to the establishment of one common theme; algorithmic architecture.
Описание: This book presents state-of-the-art research and survey articles that highlight work done within the Priority Program SPP 1489 "Algorithmic and Experimental Methods in Algebra, Geometry and Number Theory", which was established and generously supported by the German Research Foundation (DFG) from 2010 to 2016.
Автор: Theodore J. Saclarides, Jonathan A. Myers, Keith Название: Common Surgical Diseases An Algorithmic Approach to Problem Solving ISBN: 1493915649 ISBN-13(EAN): 9781493915644 Издательство: Springer Рейтинг: Цена: 20962.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Written by leaders in the field, the third edition of Common Surgical Diseases: An Algorithmic Approach to Problem Solving, provides surgical residents and medical students with a current, concise and algorithmic approach to frequently encountered clinical challenges.
Автор: A.T. Fomenko; S.V. Matveev Название: Algorithmic and Computer Methods for Three-Manifolds ISBN: 0792347706 ISBN-13(EAN): 9780792347705 Издательство: Springer Рейтинг: Цена: 15372.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Many important applied problems of mechanics and theoretical physics can be reduced to algorithmic problems of three-dimensional topology, which can then be solved using computers. This book summarizes the most outstanding achievements of modern computer topology.
Автор: Sergei Matveev Название: Algorithmic Topology and Classification of 3-Manifolds ISBN: 3642079601 ISBN-13(EAN): 9783642079603 Издательство: Springer Рейтинг: Цена: 10480.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
From the reviews of the 1st edition:
"This book provides a comprehensive and detailed account of different topics in algorithmic 3-dimensional topology, culminating with the recognition procedure for Haken manifolds and including the up-to-date results in computer enumeration of 3-manifolds. Originating from lecture notes of various courses given by the author over a decade, the book is intended to combine the pedagogical approach of a graduate textbook (without exercises) with the completeness and reliability of a research monograph...
All the material, with few exceptions, is presented from the peculiar point of view of special polyhedra and special spines of 3-manifolds. This choice contributes to keep the level of the exposition really elementary.
In conclusion, the reviewer subscribes to the quotation from the back cover: "the book fills a gap in the existing literature and will become a standard reference for algorithmic 3-dimensional topology both for graduate students and researchers."
Zentralblatt fur Mathematik 2004
For this 2nd edition, new results, new proofs, and commentaries for a better orientation of the reader have been added. In particular, in Chapter 7 several new sections concerning applications of the computer program "3-Manifold Recognizer" have been included.
The Square Root Phenomenon in Planar Graphs.- An Algorithm for Determining Whether a Pair of Polygons Is Reversible.- Disjoint Small Cycles in Graphs and Bipartite Graphs.- An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree.- Algorithms for Testing Length Four Permutations.- Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds.- Faster Exact Computation of rSPR Distance.- Arbitrated Quantum Signature Schemes: Attacks and Security.- Randomized Algorithms for Removable Online Knapsack Problems.- An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs.- FWLS: A Local Search for Graph Coloring.- A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids.- Monomial Testing and Applications.- The Optimal Rescue Path Set Problem in Undirected Graphs.- Expected Computations on Color Spanning Sets.- Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs.- Spanning Distribution Trees of Graphs.- A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem.- Zero-Visibility Cops and Robber Game on a Graph.- On (k, l)-Graph Sandwich Problems.- Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints.- Two-Round Discrete Voronoi Game along a Line.- Inverse Maximum Flow Problems under the Combining Norms.- The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs.- A Cost-Efficient Scheduling Algorithm for Traffic Grooming.- Strategies of Groups Evacuation from a Convex Region in the Plane.- Kernelization and Lower Bounds of the Signed Domination Problem.- On Edge-Independent Sets.- On the Complexity of Approximate Sum of Sorted List.- Large Hypertree Width for Sparse Random Hypergraphs.- On Perfect Absorbants in De Bruijn Digraphs.- Multi-Multiway Cut Problem on Graphs of Bounded Branch Width.- Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints.- Zero-Sum Flow Numbers of Hexagonal Grids.- Pattern-Guided k-Anonymity.
Автор: J.L. Bueso; Jos? G?mez-Torrecillas; A. Verschoren Название: Algorithmic Methods in Non-Commutative Algebra ISBN: 9048163285 ISBN-13(EAN): 9789048163281 Издательство: Springer Рейтинг: Цена: 13974.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The already broad range of applications of ring theory has been enhanced in the eighties by the increasing interest in algebraic structures of considerable complexity, the so-called class of quantum groups. One of the fundamental properties of quantum groups is that they are modelled by associative coordinate rings possessing a canonical basis, which allows for the use of algorithmic structures based on Groebner bases to study them. This book develops these methods in a self-contained way, concentrating on an in-depth study of the notion of a vast class of non-commutative rings (encompassing most quantum groups), the so-called Poincar -Birkhoff-Witt rings. We include algorithms which treat essential aspects like ideals and (bi)modules, the calculation of homological dimension and of the Gelfand-Kirillov dimension, the Hilbert-Samuel polynomial, primality tests for prime ideals, etc.
Автор: A. Ershov; C.H.A. Koster Название: Methods of Algorithmic Language Implementation ISBN: 3540080651 ISBN-13(EAN): 9783540080657 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
