Schaum`s outline of Boolean algebra and switching circuits, Mendelson, Elliot,
Автор: Thomas W. Cusick Название: Cryptographic Boolean Functions and Applications, ISBN: 0123748909 ISBN-13(EAN): 9780123748904 Издательство: Elsevier Science Цена: 29470 T Наличие на складе: Поставка под заказ. Описание: Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce).Cryptographic Boolean Functions and Applications is a concise reference that shows how Boolean functions are used in cryptography. Currently, practitioners who need to apply Boolean functions in the design of cryptographic algorithms and protocols need to patch together needed information from a variety of resources (books, journal articles and other sources). This book compiles the key essential information in one easy to use, step-by-step reference. Beginning with the basics of the necessary theory the book goes on to examine more technical topics, some of which are at the frontier of current research.
Автор: Paterson Название: Boolean Function Complexity ISBN: 0521408261 ISBN-13(EAN): 9780521408264 Издательство: Cambridge Academ Рейтинг: Цена: 21680 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: By considering the size of the logical network needed to perform a given computational task, the intrinsic difficulty of that task can be examined. Boolean function complexity, the combinatorial study of such networks, is a subject that started back in the 1950s and has today become one of the most challenging and vigorous areas of theoretical computer science. The papers in this book stem from the London Mathematical Society Symposium on Boolean Function Complexity held at Durham University in July 1990. The range of topics covered will be of interest to the newcomer to the field as well as the expert, and overall the papers are representative of the research presented at the Symposium. Anyone with an interest in Boolean Function complexity will find that this book is a necessary purchase.
Автор: Cusick, Thomas W. Название: Cryptographic Boolean Functions and Applications ISBN: 0128111291 ISBN-13(EAN): 9780128111291 Издательство: Elsevier Science Рейтинг: Цена: 36040 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Cryptographic Boolean Functions and Applications, Second Edition is designed to be a comprehensive reference for the use of Boolean functions in modern cryptography. While the vast majority of research on cryptographic Boolean functions has been achieved since the 1970s, when cryptography began to be widely used in everyday transactions, in particular banking, relevant material is scattered over hundreds of journal articles, conference proceedings, books, reports and notes, some of them only available online. . This book follows the previous edition in sifting through this compendium and gathering the most significant information in one concise reference book. The work therefore encompasses over 600 citations, covering every aspect of the applications of cryptographic Boolean functions. . Since 2008, the subject has seen a very large number of new results, and in response, the authors have prepared a new chapter on special functions. The new edition brings 100 completely new references and an expansion of 50 new pages, along with heavy revision throughout the text.
Автор: Nadia Creignou Название: Complexity Classifications of Boolean Constraint Satisfaction Problems ISBN: 0898714796 ISBN-13(EAN): 9780898714791 Издательство: Eurospan Рейтинг: Цена: 51360 T Наличие на складе: Нет в наличии. Описание: Many fundamental combinatorial problems, arising in such diverse fields as artificial intelligence, logic, graph theory, and linear algebra, can be formulated as Boolean constraint satisfaction problems (CSP). This book is devoted to the study of the complexity of such problems. The authors' goal is to develop a framework for classifying the complexity of Boolean CSP in a uniform way. In doing so, they bring out common themes underlying many concepts and results in both algorithms and complexity theory. The results and techniques presented here show that Boolean CSP provide an excellent framework for discovering and formally validating 'global' inferences about the nature of computation. This book presents a novel and compact form of a compendium that classifies an infinite number of problems by using a rule-based approach. This enables practitioners to determine whether or not a given problem is known to be computationally intractable.
Название: Jukna, Boolean Function Complexity (Algorithms and Combinatorics 27) ISBN: 3642245072 ISBN-13(EAN): 9783642245077 Издательство: Springer Рейтинг: Цена: 47300 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this “complexity Waterloo” that have been discovered over the past several decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics.
Автор: Crama Название: Boolean Functions ISBN: 0521847516 ISBN-13(EAN): 9780521847513 Издательство: Cambridge Academ Рейтинг: Цена: 70010 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Written by prominent experts in the field, this monograph provides the first comprehensive, unified presentation of the structural, algorithmic and applied aspects of the theory of Boolean functions. The book focuses on algebraic representations of Boolean functions, especially disjunctive and conjunctive normal form representations. This framework looks at the fundamental elements of the theory (Boolean equations and satisfiability problems, prime implicants and associated short representations, dualization), an in-depth study of special classes of Boolean functions (quadratic, Horn, shellable, regular, threshold, read-once functions and their characterization by functional equations) and two fruitful generalizations of the concept of Boolean functions (partially defined functions and pseudo-Boolean functions). Several topics are presented here in book form for the first time. Because of the depth and breadth and its emphasis on algorithms and applications, this monograph will have special appeal for researchers and graduate students in discrete mathematics, operations research, computer science, engineering and economics.
Автор: Cheng Название: Analysis and Control of Boolean Networks ISBN: 0857290967 ISBN-13(EAN): 9780857290960 Издательство: Springer Рейтинг: Цена: 91830 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Analysis and Control of Boolean Networks presents a systematic new approach to the investigation of Boolean control networks. The fundamental tool in this approach is a novel matrix product called the semi-tensor product (STP). Using the STP, a logical function can be expressed as a conventional discrete-time linear system. In the light of this linear expression, certain major issues concerning Boolean network topology – fixed points, cycles, transient times and basins of attractors – can be easily revealed by a set of formulae. This framework renders the state-space approach to dynamic control systems applicable to Boolean control networks. The bilinear-systemic representation of a Boolean control network makes it possible to investigate basic control problems including controllability, observability, stabilization, disturbance decoupling etc.
Автор: Padmanabhan, R. Rudeanu, S. Название: Axioms for lattices and boolean algebras ISBN: 9812834540 ISBN-13(EAN): 9789812834546 Издательство: World Scientific Publishing Рейтинг: Цена: 59990 T Наличие на складе: Поставка под заказ. Описание: Presents minimal equational axiom-systems for various lattice-related algebras, regardless of whether they are given in terms of `join and meet` or other types of operations such as ternary operations.
Автор: Monk Название: Cardinal invariants on boolean algebras ISBN: 3034603339 ISBN-13(EAN): 9783034603331 Издательство: Springer Рейтинг: Цена: 33390 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This text covers cardinal number valued functions defined for any Boolean algebra such as cellularity. It explores the behavior of these functions under algebraic operations such as products, free products, ultraproducts and their relationships to each other.
Автор: Steven Givant; Paul Halmos Название: Introduction to Boolean Algebras ISBN: 0387402934 ISBN-13(EAN): 9780387402932 Издательство: Springer Рейтинг: Цена: 23900 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Suitable for advanced undergraduates and beginning graduate students, this book treats Boolean algebras, develops some ideas, and provides insights. It includes explanation of the relationship between Boolean rings and Boolean algebras. It features chapters on topology and on continuous functions.
Казахстан, 010000 Астана р-он Сарыарка, ул. Московская, д. 40, офис 425 ТОО "Логобук" Тел:+7(7172) 49-21-32, +7(707) 857-29-98 www.logobook.kz