Оформить заказ
+7(495) 980-12-10
  10:00-18:00 пн-сб
    shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
  Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Специальные предложения | Бестселлеры
 
 
Книги
Книги зарубежных издательств на иностранных языках

Книги российских издательств

Представительство в Казахстане
 
Вход в систему
 
Войти
Регистрация  Забыли?
 
Информация
Контакты/Адрес/Проезд
Корзина
Ваши заказы
Доставка и Оплата
Заказ по телефону/email
Помощь
Есть вопрос?
О компании
Политика конфиденциальности
LgBook.ru
FkBook.ru
 
Online Каталоги
Каталог учебной литературы
по английскому языку >>>

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


Boolean Functions, Crama

Boolean Functions

Автор: Crama
Название:  Boolean Functions
Издательство: Cambridge Academ
Классификация:
Основы математики
Оптимизация
Компьютерная архитектура и логическое проектирование

ISBN: 0521847516
ISBN-13(EAN): 9780521847513
ISBN: 0-521-84751-6
ISBN-13(EAN): 978-0-521-84751-3
Обложка/Формат: Hardback
Страницы: 710
Вес: 0.126 кг.
Дата издания: 14.07.2011
Серия: Encyclopedia of Mathematics and its Applications
Язык: ENG
Иллюстрации: 98 b/w illus. 227 exercises
Размер: 234 x 156 x 51
Читательская аудитория: operations research, applied mathematics, computer science, engineering
Основная тема: Statistics and probability
Подзаголовок: Theory, Algorithms, and Applications
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Англии
Описание: 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.
Описание: Provides the first comprehensive, unified presentation of the structural, algorithmic and applied aspects of the theory of Boolean functions.
Дополнительное описание:

 Добавить в Мои желания

 Варианты приобретения 
  Кол-во Наличие на складе Цена р.
1 Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Америка: 108шт.  
При оформлении заказа до: 24 ноя 2017
Ориентировочная дата поставки: конец Декабря
При условии наличия книги у поставщика.
9904.00
 Добавить в корзину


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

в Мои желания
Schaum`s outline of Boolean algebra and switching circuits

Автор: Mendelson, Elliot,
Название: Schaum`s outline of Boolean algebra and switching circuits
ISBN: 0070414602 ISBN-13(EAN): 9780070414600
Издательство: McGraw-Hill
Рейтинг:
Цена: 879 р.
Наличие на складе: Есть (более 5-х шт.)

в Мои желания
THE SATISFIABILITY PROBLEM & BOOLEAN FUNCTIONS   TDM

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

в Мои желания
Boolean Functions and Computation Models

Автор: Clote Peter, Kranakis Evangelos
Название: Boolean Functions and Computation Models
ISBN: 3540594361 ISBN-13(EAN): 9783540594369
Издательство: Springer
Рейтинг:
Цена: 5771 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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
Рейтинг:
Цена: 3307 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.

в Мои желания
Handbook of Boolean Algebras,2

Автор: Author Unknown
Название: Handbook of Boolean Algebras,2
ISBN: 0444871527 ISBN-13(EAN): 9780444871527
Издательство: Elsevier Science
Рейтинг:
Цена: 4231 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

в Мои желания
Jukna, Boolean Function Complexity (Algorithms and Combinatorics 27)

Название: Jukna, Boolean Function Complexity (Algorithms and Combinatorics 27)
ISBN: 3642245072 ISBN-13(EAN): 9783642245077
Издательство: Springer
Рейтинг:
Цена: 5389 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.

в Мои желания
Cardinal invariants on boolean algebras

Автор: Monk
Название: Cardinal invariants on boolean algebras
ISBN: 3034603339 ISBN-13(EAN): 9783034603331
Издательство: Springer
Рейтинг:
Цена: 4619 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

в Мои желания
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.

в Мои желания
From Boolean Logic to Switching Circuits and Automata

Автор: Stankovic
Название: From Boolean Logic to Switching Circuits and Automata
ISBN: 3642116817 ISBN-13(EAN): 9783642116810
Издательство: Springer
Рейтинг:
Цена: 12233 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.   

в Мои желания
Complexity Classifications of Boolean Constraint Satisfaction Problems

Автор: Nadia Creignou
Название: Complexity Classifications of Boolean Constraint Satisfaction Problems
ISBN: 0898714796 ISBN-13(EAN): 9780898714791
Издательство: Cambridge Academ
Рейтинг:
Цена: 4908 р.
Наличие на складе: Поставка под заказ.

Описание: 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.

в Мои желания
High Quality Test Pattern Generation and Boolean Satisfiability

Автор: Eggersgl??
Название: High Quality Test Pattern Generation and Boolean Satisfiability
ISBN: 1441999752 ISBN-13(EAN): 9781441999757
Издательство: Springer
Рейтинг:
Цена: 9355 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book provides an overview of automatic test pattern generation (ATPG) and introduces novel techniques to complement classical ATPG, based on Boolean Satisfiability (SAT).  A fast and highly fault efficient SAT-based ATPG framework is presented which is also able to generate high-quality delay tests such as robust path delay tests, as well as tests with long propagation paths to detect small delay defects. The aim of the techniques and methodologies presented in this book is to improve SAT-based ATPG, in order to make it applicable in industrial practice. Readers will learn to improve the performance and robustness of the overall test generation process, so that the ATPG algorithm reliably will generate test patterns for most targeted faults in acceptable run time to meet the high fault coverage demands of industry. The techniques and improvements presented in this book provide the following advantages: Provides a comprehensive introduction to test generation and Boolean Satisfiability (SAT); Describes a highly fault efficient SAT-based ATPG framework; Introduces circuit-oriented SAT solving techniques, which make use of structural information and are able to accelerate the search process significantly;Provides SAT formulations for the prevalent delay faults models, in addition to the classical stuck-at fault model;Includes an industrial perspective on the state-of-the-art in the testing, along with SAT; two topics typically distinguished from each other.

в Мои желания

 
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru