000 04008nam a22005655i 4500
001 978-3-031-79812-2
003 DE-He213
005 20240730163507.0
007 cr nn 008mamaa
008 220601s2010 sz | s |||| 0|eng d
020 _a9783031798122
_9978-3-031-79812-2
024 7 _a10.1007/978-3-031-79812-2
_2doi
050 4 _aT1-995
072 7 _aTBC
_2bicssc
072 7 _aTEC000000
_2bisacsh
072 7 _aTBC
_2thema
082 0 4 _a620
_223
100 1 _aSasao, Tsutomu.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_978866
245 1 0 _aProgress in Applications of Boolean Functions
_h[electronic resource] /
_cby Tsutomu Sasao, Jon Butler.
250 _a1st ed. 2010.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2010.
300 _aXIV, 139 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSynthesis Lectures on Digital Circuits & Systems,
_x1932-3174
505 0 _aEquivalence 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 _aThis 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.
650 0 _aEngineering.
_99405
650 0 _aElectronic circuits.
_919581
650 0 _aControl engineering.
_931970
650 0 _aRobotics.
_92393
650 0 _aAutomation.
_92392
650 0 _aComputers.
_98172
650 1 4 _aTechnology and Engineering.
_978867
650 2 4 _aElectronic Circuits and Systems.
_978868
650 2 4 _aControl, Robotics, Automation.
_931971
650 2 4 _aComputer Hardware.
_933420
700 1 _aButler, Jon.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_978869
710 2 _aSpringerLink (Online service)
_978870
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031798115
776 0 8 _iPrinted edition:
_z9783031798139
830 0 _aSynthesis Lectures on Digital Circuits & Systems,
_x1932-3174
_978871
856 4 0 _uhttps://doi.org/10.1007/978-3-031-79812-2
912 _aZDB-2-SXSC
942 _cEBK
999 _c84672
_d84672