000			03647nam a22004215i 4500
999			_c386900 _d386900
001			386900
003			ES-MaUEC
005			20230201194800.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220601s2010 sz | s |||| 0|eng d
020			_a9783031798122
024	7		_a10.1007/978-3-031-79812-2 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA10.3 _b2010 EB
100	1		_aSasao, Tsutomu, _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9686476 _d1950-
245	1	0	_aProgress in Applications of Boolean Functions _cby Tsutomu Sasao, Jon Butler
250			_a1st edition 2010
264		1	_aCham _bSpringer International Publishing _c2010
300			_a1 recurso en línea (XIV, 139 páginas)
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_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 are necessary 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.
988			_aSynthesis Collection of Technology_2010
650		7	_2embne _9405096 _aBoole, Álgebra de
650		7	_2embne _9158201 _aCriptografía (Informática)
700	1		_aButler, Jon _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9686475
776	0	8	_iPrinted edition: _z9783031798115
776	0	8	_iPrinted edition: _z9783031798139
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-79812-2 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b01/2023 _dz _esc _zSI