๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Dualization of regular Boolean functions

โœ Scribed by Y. Crama


Book ID
104183868
Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
419 KB
Volume
16
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Boolean Algebras of Regular Languages
โœ Konovalov*, A. S.; Selivanov* **, V. L. ๐Ÿ“‚ Article ๐Ÿ“… 2014 ๐Ÿ› Springer US ๐ŸŒ English โš– 1007 KB
Recognition and dualization of disguised
โœ Thomas Eiter; Toshihide Ibaraki; Kazuhisa Makino ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 109 KB

We consider the problem of dualizing a Boolean function f given by CNF, i.e., computing a CNF for its dual f d . While this problem is not solvable in quasi-polynomial total time in general (unless SAT is solvable in quasi-polynomial time), it is so in case the input belongs to special classes, e.g.

Graph Functions of Boolean Functions
โœ Reischer, Corina; Simovici, Dan A. ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› IEEE ๐ŸŒ English โš– 511 KB
Cryptographic Boolean Functions and Appl
โœ Cusick, Thomas W. ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier ๐ŸŒ English โš– 184 KB

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). Cryptographic Boolean Functions and Applications is a