Computational and Algorithmic Problems in Finite Fields, Igor Shparlinski
Автор: 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.
Автор: Murty Katta Gopalakrishna Название: Computational And Algorithmic Linear Algebra And N-Dimensional Geometry ISBN: 9814366625 ISBN-13(EAN): 9789814366625 Издательство: World Scientific Publishing Рейтинг: Цена: 16790.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Deals with Linear Algebra and n-Dimensional Geometry. This title is suitable for sophomore level undergraduates in mathematics, engineering, business, and the sciences.
Автор: M.Y. Hussaini; A. Kumar; M.D. Salas Название: Algorithmic Trends in Computational Fluid Dynamics ISBN: 1461276381 ISBN-13(EAN): 9781461276388 Издательство: Springer Рейтинг: Цена: 16769.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume contains the proceedings of the ICASE/LaRC Work- shop on the "Algorithmic Trends for Computational Fluid Dynamics (CFD) in the 90's" conducted by the Institute for Computer Applica- tions in Science and Engineering (ICASE) and the Fluid Mechanics Division of NASA Langley Research Center during September 15-17, 1991. The purpose of the workshop was to bring together numerical analysts and computational fluid dynamicists i) to assess the state of the art in the areas of numerical analysis particularly relevant to CFD, ii) to identify promising new developments in various areas of numerical analysis that will have impact on CFD, and iii) to establish a long-term perspective focusing on opportunities and needs. This volume consists of five chapters - i) Overviews, ii) Accelera- tion Techniques, iii) Spectral and Higher-Order Methods, iv) Multi- Resolution/ Subcell Resolution Schemes (including adaptive meth- ods), and v) Inherently Multidimensional Schemes. Each chapter covers a session of the Workshop. The chapter on overviews contains the articles by J. L. Steger, H.-O. Kreiss, R. W. MacCormack, O.
Автор: Murty Katta Gopalakrishna Название: Computational And Algorithmic Linear Algebra And N-Dimensional Geometry ISBN: 9814366633 ISBN-13(EAN): 9789814366632 Издательство: World Scientific Publishing Рейтинг: Цена: 8870.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Deals with Linear Algebra and n-Dimensional Geometry. This title is suitable for sophomore level undergraduates in mathematics, engineering, business, and the sciences.
Автор: 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.
Автор: 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.
Автор: Jean-Camille Birget; Stuart Margolis; John Meakin; Название: Algorithmic Problems in Groups and Semigroups ISBN: 1461271266 ISBN-13(EAN): 9781461271260 Издательство: Springer Рейтинг: Цена: 13974.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Peter Auer; Alexander Clark; Thomas Zeugmann; Sand Название: Algorithmic Learning Theory ISBN: 3319116614 ISBN-13(EAN): 9783319116617 Издательство: Springer Рейтинг: Цена: 7826.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
Inductive Inference.- Exact Learning from Queries.- Reinforcement Learning.- Online Learning and Learning with Bandit Information.- Statistical Learning Theory.- Privacy, Clustering, MDL, and Kolmogorov Complexity.
Автор: Emilio Frazzoli; Tomas Lozano-Perez; Nicholas Roy; Название: Algorithmic Foundations of Robotics X ISBN: 3642362788 ISBN-13(EAN): 9783642362781 Издательство: Springer Рейтинг: Цена: 34937.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This is the proceedings of the tenth WAFR, held at Massachusetts Institute of Technology in June 2012. Its 37 papers address a broad range of topics, from fundamental theoretical issues in robot motion planning, control and perception, to novel applications.
Автор: Vittorio Bil?; Michele Flammini Название: Algorithmic Game Theory ISBN: 3319666991 ISBN-13(EAN): 9783319666990 Издательство: Springer Рейтинг: Цена: 9083.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 10th International Symposium on Algorithmic Game Theory, SAGT 2017, held in L`Aquila, Italy, in September 2017. The 30 full papers presented were carefully reviewed and selected from 66 submissions.
Автор: Simone Pinna Название: Extended Cognition and the Dynamics of Algorithmic Skills ISBN: 3319518402 ISBN-13(EAN): 9783319518404 Издательство: Springer Рейтинг: Цена: 12577.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book describes a novel methodology for studying algorithmic skills, intended as cognitive activities related to rule-based symbolic transformation, and argues that some human computational abilities may be interpreted and analyzed as genuine examples of extended cognition.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
