Контакты/Адрес/Проезд   Доставка и Оплата
История
  +7 707 857-29-98
  +7(7172) 49-21-32
  10:00-18:00 пн-пт
  shop@logobook.kz
   
    Поиск книг                        
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Специальные предложения | Бестселлеры
 
Информация
Online Каталоги
Каталог учебной литературы
по английскому языку >>>

Каталог учебной литературы
по английскому языку >>>


Schaum`s outline of Boolean algebra and switching circuits, Mendelson, Elliot,


Варианты приобретения
Цена: 7830T   11186 T -30%
Кол-во:
Наличие: Есть (более 5-ти шт.)
Есть на складе в Москве. Доставка в магазин в Астане 5-7 дней.

Добавить в корзину
в Мои желания
Автор: Mendelson, Elliot,
Название:  Schaum`s outline of Boolean algebra and switching circuits   (Принципы булевой алгебры и схем переключения)
Издательство: McGraw-Hill
Классификация:
Математика, Физика, Химия, Биология и др. точные науки
Математика
Основы математики
Прикладная математика

ISBN: 0070414602
ISBN-13(EAN): 9780070414600
ISBN: 0-07-041460-2
ISBN-13(EAN): 978-0-07-041460-0
Обложка/Формат: Hardback
Страницы: 224
Вес: 0.528 кг.
Дата издания: 01.01.1970
Серия: Schaum`s outline series
Иллюстрации: D.
Размер: 272 x 204 x 12
Читательская аудитория: Tertiary education (us: college)
Рейтинг:
Поставляется из: Англии
Описание: Contains 150 problems with solutions; explanations of theory and applications; coverage of the material in Boolean algebra courses; a solved-problem approach that teaches with hands-on help; and exercises for improving problem-solving skills.

From Boolean Logic to Switching Circuits and Automata

Автор: Stankovic
Название: From Boolean Logic to Switching Circuits and Automata
ISBN: 3642116817 ISBN-13(EAN): 9783642116810
Издательство: Springer
Рейтинг:
Цена: 88420 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Logic networks and automata are facets of digital systems. The change of  the design of logic networks from skills and art into a scientific discipline was possible by the development of the  underlying mathematical theory called the Switching Theory. The fundamentals of this theory come from the attempts towards an algebraic description of laws of thoughts presented  in the works by George J. Boole and  the works on logic by Augustus De Morgan. As often the case in engineering, when the importance of a problem and the need for solving it reach certain limits, the solutions are searched by many scholars in different parts of the word, simultaneously or at about the same time, however, quite independently and often unaware of  the work by other scholars. The formulation and rise of Switching Theory is such an example.  This book  presents a brief account of the developments of Switching Theory and highlights some less known facts in the history of it.  The readers will find the book a fresh look into the development of the field revealing how difficult it has been to arrive at many of the concepts that we now consider obvious . Researchers in the history or philosophy of computing will find this book a valuable source of information that complements the standard presentations of the topic.   

Cryptographic  Boolean  Functions and Applications,

Автор: 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.

Boolean Function Complexity

Автор: Paterson
Название: Boolean Function Complexity
ISBN: 0521408261 ISBN-13(EAN): 9780521408264
Издательство: Cambridge Academ
Рейтинг:
Цена: 17340 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.

Cryptographic Boolean Functions and Applications

Автор: 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.

THE SATISFIABILITY PROBLEM & BOOLEAN FUNCTIONS   TDM

Автор: FRANCO
Название: THE SATISFIABILITY PROBLEM & BOOLEAN FUNCTIONS TDM
ISBN: 0444504109 ISBN-13(EAN): 9780444504104
Издательство: Elsevier Science
Рейтинг:
Цена: 129090 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Jukna, Boolean Function Complexity (Algorithms and Combinatorics 27)

Название: 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.

Boolean Functions

Автор: Crama
Название: Boolean Functions
ISBN: 0521847516 ISBN-13(EAN): 9780521847513
Издательство: Cambridge Academ
Рейтинг:
Цена: 80540 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.

Analysis and Control of Boolean Networks

Автор: 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.

Axioms for lattices and boolean algebras

Автор: 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.

Cardinal invariants on boolean algebras

Автор: 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.

Boolean Functions and Computation Models

Автор: Clote Peter, Kranakis Evangelos
Название: Boolean Functions and Computation Models
ISBN: 3540594361 ISBN-13(EAN): 9783540594369
Издательство: Springer
Рейтинг:
Цена: 41710 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This textbook presents a survey of research on boolean functions, circuits, parallel computation models, function algebras, and proof systems. Its main aim is to elucidate the structure of "fast" parallel computation. The complexity of parallel computation is emphasized through a variety of techniques ranging from finite combinatorics, probability theory and finite group theory to finite model theory and proof theory. Nonuniform computation models are studied in the form of boolean circuits; uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems. The book will benefit advanced undergraduates and graduate students as well as researchers in the field of complexity theory.

Introduction to Boolean Algebras

Автор: 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
     Мобильная версия