Автор: Claude Carlet Название: Boolean Functions for Cryptography and Coding Theory ISBN: 1108473806 ISBN-13(EAN): 9781108473804 Издательство: Cambridge Academ Рейтинг: Цена: 11880.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This complete and accessible survey of Boolean functions for cryptography and coding, written for researchers and graduate students, balances all necessary background with comprehensive state of the art coverage, and tackles recent problems and applications like side channel attacks, Gowers norm, and cloud computing.
Автор: O`Donnell Название: Analysis of Boolean Functions ISBN: 1107038324 ISBN-13(EAN): 9781107038325 Издательство: Cambridge Academ Рейтинг: Цена: 11405.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This graduate-level text gives a thorough overview of the field, beginning with the most basic definitions and proceeding to advanced topics such as hypercontractivity and isoperimetry. Each chapter includes a `highlight application` such as Arrow`s theorem, the Goldreich-Levin algorithm, hardness of approximation, and `sharp threshold` theorems for random graphs.
Автор: John Rhodes; Pedro V. Silva Название: Boolean Representations of Simplicial Complexes and Matroids ISBN: 3319383671 ISBN-13(EAN): 9783319383675 Издательство: Springer Рейтинг: Цена: 11878.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This self-contained monograph explores a new theory centered around boolean representations of simplicial complexes leading to a new class of complexes featuring matroids as central to the theory.
Автор: John Rhodes; Pedro V. Silva Название: Boolean Representations of Simplicial Complexes and Matroids ISBN: 3319151134 ISBN-13(EAN): 9783319151137 Издательство: Springer Рейтинг: Цена: 11878.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This self-contained monograph explores a new theory centered around boolean representations of simplicial complexes leading to a new class of complexes featuring matroids as central to the theory.
Автор: B. V. Senthil Kumar, Hemen Dutta Название: Discrete Mathematical Structures: A Succinct Foundation ISBN: 0367148692 ISBN-13(EAN): 9780367148690 Издательство: Taylor&Francis Рейтинг: Цена: 23734.00 р. Наличие на складе: Нет в наличии.
Описание: Discrete mathematical Structures are very essential for many fields of study. This book is designed as an introductory book that will provide a sufficient number of solved examples, to motivate the reader to solve similar types of problems.
Автор: Florentin Smarandache, Said Broumi Название: Neutrosophic Graph Theory and Algorithms ISBN: 1799813142 ISBN-13(EAN): 9781799813149 Издательство: Mare Nostrum (Eurospan) Цена: 27027.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Graph theory is a specific concept that has numerous applications throughout many industries. Despite the advancement of this technique, graph theory can still yield ambiguous and imprecise results. In order to cut down on these indeterminate factors, neutrosophic logic has emerged as an applicable solution that is gaining significant attention in solving many real-life decision-making problems that involve uncertainty, impreciseness, vagueness, incompleteness, inconsistency, and indeterminacy. However, empirical research on this specific graph set is lacking. Neutrosophic Graph Theory and Algorithms is a collection of innovative research on the methods and applications of neutrosophic sets and logic within various fields including systems analysis, economics, and transportation. While highlighting topics including linear programming, decision-making methods, and homomorphism, this book is ideally designed for programmers, researchers, data scientists, mathematicians, designers, educators, researchers, academicians, and students seeking current research on the various methods and applications of graph theory.
Описание: This monograph deals with mathematical constructions that are foundational in such an important area of data mining as pattern recognition. By using combinatorial and graph theoretic techniques, a closer look is taken at infeasible systems of linear inequalities, whose generalized solutions act as building blocks of geometric decision rules for pattern recognition.Infeasible systems of linear inequalities prove to be a key object in pattern recognition problems described in geometric terms thanks to the committee method. Such infeasible systems of inequalities represent an important special subclass of infeasible systems of constraints with a monotonicity property - systems whose multi-indices of feasible subsystems form abstract simplicial complexes (independence systems), which are fundamental objects of combinatorial topology.The methods of data mining and machine learning discussed in this monograph form the foundation of technologies like big data and deep learning, which play a growing role in many areas of human-technology interaction and help to find solutions, better solutions and excellent solutions. Contents: PrefacePattern recognition, infeasible systems of linear inequalities, and graphsInfeasible monotone systems of constraintsComplexes, (hyper)graphs, and inequality systemsPolytopes, positive bases, and inequality systemsMonotone Boolean functions, complexes, graphs, and inequality systemsInequality systems, committees, (hyper)graphs, and alternative coversBibliographyList of notationIndex
Автор: Klivans Название: The Mathematics of Chip-Firing ISBN: 1138070823 ISBN-13(EAN): 9781138070820 Издательство: Taylor&Francis Рейтинг: Цена: 26796.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The Mathematics of Chip-firing is a solid introduction and overview of the growing field of chip-firing. It offers an appreciation for the richness and diversity of the subject. Chip-firing refers to a discrete dynamical system - a commodity is exchanged between sites of a network according to very simple local rules.
Автор: Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger, Ulrich Hertrampf Название: Discrete Algebraic Methods: Arithmetic, Cryptography, Automata and Groups ISBN: 3110413329 ISBN-13(EAN): 9783110413328 Издательство: Walter de Gruyter Цена: 6499.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The idea behind this book is to provide the mathematical foundations for assessing modern developments in the Information Age. It deepens and complements the basic concepts, but it also considers instructive and more advanced topics. The treatise starts with a general chapter on algebraic structures; this part provides all the necessary knowledge for the rest of the book. The next chapter gives a concise overview of cryptography. Chapter 3 on number theoretic algorithms is important for developping cryptosystems, Chapter 4 presents the deterministic primality test of Agrawal, Kayal, and Saxena. The account to elliptic curves again focuses on cryptographic applications and algorithms. With combinatorics on words and automata theory, the reader is introduced to two areas of theoretical computer science where semigroups play a fundamental role.The last chapter is devoted to combinatorial group theory and its connections to automata. Contents:Algebraic structuresCryptographyNumber theoretic algorithmsPolynomial time primality testElliptic curvesCombinatorics on wordsAutomataDiscrete infinite groups
Автор: Matveev, Andrey O., Название: Pattern recognition on oriented matroids / ISBN: 3110530716 ISBN-13(EAN): 9783110530711 Издательство: Walter de Gruyter Рейтинг: Цена: 18586.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
Pattern Recognition on Oriented Matroids covers a range of innovative problems in combinatorics, poset and graph theories, optimization, and number theory that constitute a far-reaching extension of the arsenal of committee methods in pattern recognition. The groundwork for the modern committee theory was laid in the mid-1960s, when it was shown that the familiar notion of solution to a feasible system of linear inequalities has ingenious analogues which can serve as collective solutions to infeasible systems. A hierarchy of dialects in the language of mathematics, for instance, open cones in the context of linear inequality systems, regions of hyperplane arrangements, and maximal covectors (or topes) of oriented matroids, provides an excellent opportunity to take a fresh look at the infeasible system of homogeneous strict linear inequalities - the standard working model for the contradictory two-class pattern recognition problem in its geometric setting. The universal language of oriented matroid theory considerably simplifies a structural and enumerative analysis of applied aspects of the infeasibility phenomenon.
The present book is devoted to several selected topics in the emerging theory of pattern recognition on oriented matroids: the questions of existence and applicability of matroidal generalizations of committee decision rules and related graph-theoretic constructions to oriented matroids with very weak restrictions on their structural properties; a study (in which, in particular, interesting subsequences of the Farey sequence appear naturally) of the hierarchy of the corresponding tope committees; a description of the three-tope committees that are the most attractive approximation to the notion of solution to an infeasible system of linear constraints; an application of convexity in oriented matroids as well as blocker constructions in combinatorial optimization and in poset theory to enumerative problems on tope committees; an attempt to clarify how elementary changes (one-element reorientations) in an oriented matroid affect the family of its tope committees; a discrete Fourier analysis of the important family of critical tope committees through rank and distance relations in the tope poset and the tope graph; the characterization of a key combinatorial role played by the symmetric cycles in hypercube graphs.
Contents Oriented Matroids, the Pattern Recognition Problem, and Tope Committees Boolean Intervals Dehn-Sommerville Type Relations Farey Subsequences Blocking Sets of Set Families, and Absolute Blocking Constructions in Posets Committees of Set Families, and Relative Blocking Constructions in Posets Layers of Tope Committees Three-Tope Committees Halfspaces, Convex Sets, and Tope Committees Tope Committees and Reorientations of Oriented Matroids Topes and Critical Committees Critical Committees and Distance Signals Symmetric Cycles in the Hypercube Graphs
Автор: Florentin Smarandache, Said Broumi Название: Neutrosophic Graph Theory and Algorithms ISBN: 1799813134 ISBN-13(EAN): 9781799813132 Издательство: Mare Nostrum (Eurospan) Рейтинг: Цена: 35897.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Graph theory is a specific concept that has numerous applications throughout many industries. Despite the advancement of this technique, graph theory can still yield ambiguous and imprecise results. In order to cut down on these indeterminate factors, neutrosophic logic has emerged as an applicable solution that is gaining significant attention in solving many real-life decision-making problems that involve uncertainty, impreciseness, vagueness, incompleteness, inconsistency, and indeterminacy. However, empirical research on this specific graph set is lacking. Neutrosophic Graph Theory and Algorithms is a collection of innovative research on the methods and applications of neutrosophic sets and logic within various fields including systems analysis, economics, and transportation. While highlighting topics including linear programming, decision-making methods, and homomorphism, this book is ideally designed for programmers, researchers, data scientists, mathematicians, designers, educators, researchers, academicians, and students seeking current research on the various methods and applications of graph theory.
Автор: Miklos Название: Computational Complexity ISBN: 1138035572 ISBN-13(EAN): 9781138035577 Издательство: Taylor&Francis Рейтинг: Цена: 13779.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The purpose of the book is to give a comprehensive and detailed introduction to the computational complexity of counting and sampling. The book consists of three main topics: I. Counting problems that are solvable in polynomial running time, II. Approximation algorithms for counting and sampling, III. Holographic algorithms.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
