Progress in Applications of Boolean Functions (Record no. 84672)

000 -LEADER
fixed length control field 04008nam a22005655i 4500
001 - CONTROL NUMBER
control field 978-3-031-79812-2
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730163507.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 220601s2010 sz | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783031798122
-- 978-3-031-79812-2
082 04 - CLASSIFICATION NUMBER
Call Number 620
100 1# - AUTHOR NAME
Author Sasao, Tsutomu.
245 10 - TITLE STATEMENT
Title Progress in Applications of Boolean Functions
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2010.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XIV, 139 p.
490 1# - SERIES STATEMENT
Series statement Synthesis Lectures on Digital Circuits & Systems,
505 0# - FORMATTED CONTENTS NOTE
Remark 2 Equivalence Classes of Boolean Functions -- Boolean Functions for Cryptography -- Boolean Differential Calculus -- Synthesis of Boolean Functions in Reversible Logic -- Data Mining Using Binary Decision Diagrams.
520 ## - SUMMARY, ETC.
Summary, etc This book brings together five topics on the application of Boolean functions. They are 1. Equivalence classes of Boolean functions: The number of n-variable functions is large, even for values as small as n = 6, and there has been much research on classifying functions. There are many classifications, each with their own distinct merit. 2. Boolean functions for cryptography: The process of encrypting/decrypting plaintext messages often depends on Boolean functions with specific properties. For example, highly nonlinear functions are valued because they are less susceptible to linear attacks. 3. Boolean differential calculus: An operation analogous to taking the derivative of a real-valued function offers important insight into the properties of Boolean functions. One can determine tests or susceptibility to hazards. 4. Reversible logic: Most logic functions are irreversible; it is impossible to reconstruct the input, given the output. However, Boolean functions that are reversible arenecessary for quantum computing, and hold significant promise for low-power computing. 5. Data mining: The process of extracting subtle patterns from enormous amounts of data has benefited from the use of a graph-based representation of Boolean functions. This has use in surveillance, fraud detection, scientific discovery including bio-informatics, genetics, medicine, and education. Written by experts, these chapters present a tutorial view of new and emerging technologies in Boolean functions. Table of Contents: Equivalence Classes of Boolean Functions / Boolean Functions for Cryptography / Boolean Differential Calculus / Synthesis of Boolean Functions in Reversible Logic / Data Mining Using Binary Decision Diagrams.
700 1# - AUTHOR 2
Author 2 Butler, Jon.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://doi.org/10.1007/978-3-031-79812-2
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2010.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Engineering.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Electronic circuits.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Control engineering.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Robotics.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Automation.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computers.
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Technology and Engineering.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Electronic Circuits and Systems.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Control, Robotics, Automation.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer Hardware.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 1932-3174
912 ## -
-- ZDB-2-SXSC

No items available.