+7(495) 980-12-10
  10:00-18:00 пн-пт
    shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
  Зарубежные издательства Российские издательства  
   Авторы    Каталог книг    Издательства    Новинки    Учебная литература    Специальные предложения  Бестселлеры
 
 
Книги    
Logobook
Книги зарубежных издательств на иностранных языках
Logobook
Книги российских издательств
Logobook
Представительство в Казахстане
 
Вход в систему   
 
Регистрация  Забыли?
 
Информация   
Контакты/Адрес/Проезд
Корзина
Ваши заказы
Доставка и Оплата
Заказ по телефону/email
Помощь
Есть вопрос?
О компании
LgBook.ru
FkBook.ru
 
Online Каталоги   
Cambridge University Press
Каталог учебной литературы
по английскому языку >>>

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



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

Pearson ELT

Читайте отзывы покупателей и оценивайте качество магазина на Яндекс.Маркете

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

Schaum`s outline of Boolean algebra and switching circuits

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

 Варианты приобретения 
  Кол-во Наличие на складе Цена р. Купить / Отложить
1 Есть (более 5-ти шт.)
Отгрузка заказа в течение 1 рабочего дня
879.00
Добавить в корзину
Add to Wish list

Отзывы покупателей.
Добавить отзыв.
Cryptographic  Boolean  Functions and Applications,

Автор: Thomas W. Cusick
Название: Cryptographic Boolean Functions and Applications,
ISBN: 0123748909 ISBN-13(EAN): 9780123748904
Издательство: Elsevier Science
Цена: 4077 р.
Наличие на складе: Нет в наличии.
Описание: 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).<br><br>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. <br><br>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. <br><br>-Serves as a complete resource for the successful design or implementation of cryptographic algorithms or protocols using Boolean functions <br>-Provides engineers and scientists with a needed reference for the use of Boolean functions in cryptography <br>-Addresses the issues of cryptographic Boolean functions theory and applications in one concentrated resource. <br>-Organized logically to help the reader easily understand the topic
Купить

Analysis and Control of Boolean Networks

Автор: Cheng
Название: Analysis and Control of Boolean Networks
ISBN: 0857290967 ISBN-13(EAN): 9780857290960
Издательство: Springer
Цена: 9236 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: 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.
Купить

Switching Theory / Insight through Predicate Logic

Автор: Vingron Shimon P.
Название: Switching Theory / Insight through Predicate Logic
ISBN: 3540403434 ISBN-13(EAN): 9783540403432
Издательство: Springer
Цена: 8466 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: The author’s main concern is to promote understanding of the basic ideas underlying switching theory. Nothing is taken for granted, whether it is the concept of a logic variable, that of feedback in a latch or sequential circuit, or the necessity to encode internal states. This very basic and thorough approach enables the development of new concepts such as Composition, or Verification. The theoretical side is enhanced by using predicate (instead of propositional) logic allowing for formal proofs till now unattainable. On the practical side, sequential circuits that hitherto were obtained intuitively are now open to a formal synthesis procedure.
Купить

Stochastic Switching Systems / Analysis and Design

Автор: Boukas El-KГ©bir
Название: Stochastic Switching Systems / Analysis and Design
ISBN: 0817637826 ISBN-13(EAN): 9780817637828
Издательство: Springer
Цена: 10009 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: Stochastic switching systems represent an interesting class, which can be used to model a variety of systems having abrupt random changes in their dynamics. Such systems may be found in the fields of manufacturing, communications, aerospace, power, and economics.This work presents stochastic switching systems and provides up-to-date methods and techniques for the analysis and design of various control systems with or without uncertainties. An introductory chapter highlights basic concepts and practical models, which are then used to solve more advanced problems throughout the book. Included are many numerical examples as well as LMI analysis methods and design approaches to supplement the developed results.Specific topics covered include:*&nbsp; The stochastic stability problem and its robustness. *&nbsp; The stabilization problem; different controllers such as the state feedback, output feedback, and observer-based output feedback are designed for nominal and uncertain systems using LMI conditions. *&nbsp; Systems with external disturbances; different approaches are developed to reject the external disturbances.*&nbsp; The filtering problem for the class of systems with Markovian jump parameters; Kalman and H-infinity filtering problems are treated and LMI conditions are developed to synthesize the gains of these filters.* Systems with singular Markovian jump parameters. Stochastic Switching Systems may be used as a supplementary textbook for graduate-level engineering courses, or as a reference for control engineers, graduate students, and researchers in systems and control. Prerequisites include elementary courses in matrix theory, probability, optimization techniques, and control systems theory.
Купить

Algebraic Switching Theory And Broadband Applications

Автор: Li
Название: Algebraic Switching Theory And Broadband Applications
ISBN: 0124471811 ISBN-13(EAN): 9780124471818
Издательство: Elsevier Science
Цена: 8393 р.
Наличие на складе: Нет в наличии.
Купить

Boolean Function Complexity

Автор: Paterson
Название: Boolean Function Complexity
ISBN: 0521408261 ISBN-13(EAN): 9780521408264
Издательство: Cambridge Academ
Цена: 3067 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: 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
Цена: 5540 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Купить

THE SATISFIABILITY PROBLEM & BOOLEAN FUNCTIONS   TDM

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

Jukna, Boolean Function Complexity (Algorithms and Combinatorics 27)

Название: Jukna, Boolean Function Complexity (Algorithms and Combinatorics 27)
ISBN: 3642245072 ISBN-13(EAN): 9783642245077
Издательство: Springer
Цена: 5001 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: 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
Цена: 9904 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: 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.
Купить

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
Цена: 8487 р.
Наличие на складе: Поставка под заказ.
Описание: 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.
Купить

Boolean Functions and Computation Models

Автор: Clote Peter, Kranakis Evangelos
Название: Boolean Functions and Computation Models
ISBN: 3540594361 ISBN-13(EAN): 9783540594369
Издательство: Springer
Цена: 5001 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: 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.
Купить


 
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
Visa, Master Card, Diners, AMEX, JCB, Web Money, Yandex Money Сбербанк онлайн