Algorithmic Problems in Groups and Semigroups, Jean-Camille Birget; Stuart Margolis; John Meakin;
Автор: 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.
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.
Автор: Igor Shparlinski Название: Computational and Algorithmic Problems in Finite Fields ISBN: 9401047960 ISBN-13(EAN): 9789401047968 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 'Et moi, ...- si j'avait su comment en revenir. je One service mathematics bas rendemI be n'y semis point a1J6.' human race. It bas put common sense back JulesVeme where it belongs. on tile topmost sbelf next to tile dusty canister labelled 'discarded nonsense'. The series is divergent; therefore we may be Eric T.BeIl able to do something with il O. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and nonlineari- ties abound. Similarly, all kinds of pans of mathematics serve as tools for other pans and for other sci- ences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One ser- vice topology has rendered mathematical physics ... '; 'One service logic has rendered computer science ... '; 'One service category theory has rendered mathematics .. .'. All arguably true. And all statements obtainable this way fonn pan of the raison d' 8tre of this series.
Автор: Barthelemy, Jean-Pierre. Название: Algorithmic Complexity and Telecommunication Problems ISBN: 1857284518 ISBN-13(EAN): 9781857284515 Издательство: Taylor&Francis Рейтинг: Цена: 11942.00 р. Наличие на складе: Нет в наличии.
Описание: In this treatment of algorithmic complexity the authors explore an area fundamental to the study of the foundations of computer science. It is a topic which is at the interface of information theory, applied mathematics and computer language theory and which is rooted strongly in this book in the problems of computer communication.; Complexity theory classifies problems according to the difficulty of resolving them, while algorithms provide the computational method for solving those problems. Therefore, algorithmic complexity is concerned with establishing the best algorithm given the constraints of the computational environment and the degree of complexity.; The first three chapters present the context for a later in-depth look at applied areas of the subject, with an outline of classical complexity theory. This is followed by three chapters which explore the key area of information communication. Within this field, the book is particularly concerned with two contiguous areas which make contrasting demands on the application of algorithmic complexity. Cryptography demands the creation of extremely complex problems in order to achieve its goal of security, whereas in coding for communication the emphasis is on maximizing the compact nature of the message and providing the error correction necessary for the message to achieve optimum speed. The two must co-exist and the methods outlined in Algorithmic Complexity suggest a number of approaches to such problems based on extensive examples of the authors' experience.; This senior undergraduate book should be an essential read for those studying advanced topics in theoretical computer science and should provide an introduction to applied complexity for researchers and professionals alike.
Автор: Javier Aramayona; Volker Diekert; Christopher J. L Название: Algorithmic and Geometric Topics Around Free Groups and Automorphisms ISBN: 3319609394 ISBN-13(EAN): 9783319609393 Издательство: Springer Рейтинг: Цена: 3492.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
This volume presents the lecture notes from the authors' three summer courses offered during the program "Automorphisms of Free Groups: Geometry, Topology, and Dynamics," held at the Centre de Recerca Matem tica (CRM) in Bellaterra, Spain.
The first two chapters present the basic tools needed, from formal language theory (regular and context-free languages, automata, rewriting systems, transducers, etc) and emphasize their connections to group theory, mostly relating to free and virtually-free groups. The material covered is sufficient to present full proofs of many of the existing interesting characterizations of virtually-free groups. In turn, the last chapter comprehensively describes Bonahon's construction of Thurston's compactification of Teichm ller space in terms of geodesic currents on surfaces. It also includes several intriguing extensions of the notion of geodesic current to various other, more general settings.
Автор: Kazuaki Taira Название: Semigroups, Boundary Value Problems and Markov Processes ISBN: 3662517590 ISBN-13(EAN): 9783662517598 Издательство: Springer Рейтинг: Цена: 15372.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The author studies a general class of elliptic boundary value problems for second-order, Waldenfels integro-differential operators in partial differential equations and proves that this class of elliptic boundary value problems provides a general class of Feller semigroups in functional analysis.
Автор: Kazuaki Taira Название: Semigroups, Boundary Value Problems and Markov Processes ISBN: 3642073719 ISBN-13(EAN): 9783642073717 Издательство: Springer Рейтинг: Цена: 12577.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The purpose of this book is to provide a careful and accessible account along modern lines of the subject wh ich the title deals, as weIl as to discuss prob- lems of current interest in the field. Unlike many other books on Markov processes, this book focuses on the relationship between Markov processes and elliptic boundary value problems, with emphasis on the study of analytic semigroups. More precisely, this book is devoted to the functional analytic approach to a class of degenerate boundary value problems for second-order elliptic integro-differential operators, called Waldenfels operators, whi: h in- cludes as particular cases the Dirichlet and Robin problems. We prove that this class of boundary value problems provides a new example of analytic semi- groups both in the LP topology and in the topology of uniform convergence. As an application, we construct a strong Markov process corresponding to such a physical phenomenon that a Markovian particle moves both by jumps and continuously in the state space until it "dies" at the time when it reaches the set where the particle is definitely absorbed. The approach here is distinguished by the extensive use of the techniques characteristic of recent developments in the theory of partial differential equa- tions. The main technique used is the calculus of pseudo-differential operators which may be considered as a modern theory of potentials.
Описание: This book gives a systematic treatment of the basic theory of analytic semigroups and abstract parabolic equations in general Banach spaces, and of how such a theory may be used in parabolic PDE`s.
Описание: This book shows how the abstract methods of analytic semigroups and evolution equations in Banach spaces can be applied to the study of parabolic problems. It presents known theorems from a novel perspective and teaches how to exploit basic techniques.
Автор: J?rg Rothe Название: Algorithmic Decision Theory ISBN: 3319675036 ISBN-13(EAN): 9783319675039 Издательство: Springer Рейтинг: Цена: 9083.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the conference proceedings of the 5th International Conference on Algorithmic Decision Theory , ADT 2017, held in Luxembourg, in October 2017.The 22 full papers presented together with 6 short papers, 4 keynote abstracts, and 6 Doctoral Consortium papers, were carefully selected from 45 submissions.
Автор: 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.
Автор: Taira, Kazuaki Название: Semigroups, boundary value problems and markov processes ISBN: 3662436957 ISBN-13(EAN): 9783662436950 Издательство: Springer Рейтинг: Цена: 16769.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Semigroups, Boundary Value Problems and Markov Processes
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
