000			05590nam a2200541 i 4500
001			6813232
003			IEEE
005			20200413152856.0
006			m eo d
007			cr cn |||m|||a
008			091104s2010 caua foab 001 0 eng d
020			_a9781608451821 (electronic bk.)
020			_z9781608451814 (pbk.)
024	7		_a10.2200/S00243ED1V01Y200912DCS026 _2doi
035			_a(CaBNVSL)gtp00537698
035			_a(OCoLC)495483391
040			_aCaBNVSL _cCaBNVSL _dCaBNVSL
050		4	_aQA10.3 _b.P763 2010
082	0	4	_a511.324 _222
245	0	0	_aProgress in applications of Boolean functions _h[electronic resource] / _cTsutomu Sasao, Jon T. Butler [editors].
260			_aSan Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) : _bMorgan & Claypool Publishers, _cc2010.
300			_a1 electronic text (xiv, 139 p. : ill.) : _bdigital file.
490	1		_aSynthesis lectures on digital circuits and systems, _x1932-3174 ; _v# 26
538			_aMode of access: World Wide Web.
538			_aSystem requirements: Adobe Acrobat reader.
500			_aPart of: Synthesis digital library of engineering and computer science.
500			_aSeries from website.
504			_aIncludes bibliographical references and index.
505	0		_aPreface -- 1. Equivalence classes of Boolean functions / Radomir S. Stanković, Stanislav Stanković, Helena Astola, and Jaakko T. Astola: Chapter summary; 1.1. Introduction; 1.2. Classification of switching functions; 1.3. NPN-classification; 1.4. LP-classification; 1.5. SD-classification; 1.6. Classification bywalsh coefficients; 1.7. Classification using decision diagrams; 1.8. Closing remarks; Acknowldegments; 1.9. Exercises; Bibliography -- 2. Boolean functions for cryptography / Jon T. Butler and Tsutomu Sasao: Chapter summary; 2.1. Introduction; 2.2. Properties of bent functions; 2.3. Properties of symmetric bent functions; 2.4. The strict avalanche criterion; 2.5. The propagation criterion; 2.6. Correlation immunity; 2.7. Concluding remarks; 2.8. Exercises; Bibliography -- 3. Boolean differential calculus / Bernd Steinbach and Christian Posthoff: Chapter summary; 3.1. Introduction; 3.2. Preliminaries; 3.3. Simple derivative operations; 3.4. Vectorial derivative operations; 3.5. m-fold derivative operations; 3.6. Applications to hazard detection; 3.7. Applications to decomposition; 3.8. Application to test pattern generation; 3.9. Generalization to differential operations; 3.10. Summary; 3.11. Exercises; Bibliography -- 4. Synthesis of Boolean functions in reversible logic / Robert Wille and Rolf Drechsler: Chapter summary; 4.1. Introduction; 4.2. Reversible logic; 4.3. Embedding irreversible functions; 4.4. Exact synthesis; 4.5. Heuristic synthesis; 4.6. BDD-based synthesis for large functions; 4.7. Conclusions and futurework; 4.8. Exercises; Bibliography -- 5. Data mining using binary decision diagrams / Shin-ichi Minato: Chapter summary; 5.1. Introduction; 5.2. BDD-based database representation; 5.3. LCM over ZDDs for large-scale itemset mining; 5.4. Application of LCM over ZDDs for finding distinctive itemsets; 5.5. Conclusion; 5.6. Exercises; Bibliography -- A. Solutions -- Index -- Authors' biographies.
506	1		_aAbstract freely available; full-text restricted to subscribers or individual document purchasers.
510	0		_aCompendex
510	0		_aINSPEC
510	0		_aGoogle scholar
510	0		_aGoogle book search
520	3		_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 its 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.
530			_aAlso available in print.
588			_aTitle from PDF t.p. (viewed on January 11, 2010).
650		0	_aAlgebra, Boolean.
650		0	_aCryptography.
650		0	_aQuantum computers.
650		0	_aData mining.
650		0	_aLogic design _xData processing.
700	1		_aSasao, Tsutomu, _d1950-
700	1		_aButler, Jon T.
730	0		_aSynthesis digital library of engineering and computer science.
830		0	_aSynthesis lectures on digital circuits and systems, _x1932-3174 ; _v# 26.
856	4	2	_3Abstract with links to resource _uhttp://ieeexplore.ieee.org/servlet/opac?bknumber=6813232
999			_c561730 _d561730