✦ LIBER ✦

Exclusive and essential sets of implicates of Boolean functions

✍ Scribed by Endre Boros; Ondřej Čepek; Alexander Kogan; Petr Kučera

Book ID: 108112840
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 902 KB
Volume: 158
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.08.012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exclusive-OR Representations of Boolean

Exclusive-OR Representations of Boolean Functions

✍ H. Fleisher; M. Tavel; J. Yeager 📂 Article 📅 1983 🏛 IBM 🌐 English ⚖ 387 KB

Exclusion sensitivity of Boolean functio

Exclusion sensitivity of Boolean functions

✍ Erik I. Broman, Christophe Garban… 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 549 KB

Disjoint essential sets of implicates of

Disjoint essential sets of implicates of a CQ Horn function

✍ Ondřej Čepek; Petr Kučera 📂 Article 📅 2011 🏛 Springer Netherlands 🌐 English ⚖ 365 KB

Concerning the maximum number of essenti

Concerning the maximum number of essential prime implicants in a Boolean function

✍ Gómez-gonzález, Lorenzo 📂 Article 📅 1978 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 144 KB

Representations of sets of Boolean funct

Representations of sets of Boolean functions by commutative rings

✍ Roman Smolensky 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 524 KB

Cryptographic Boolean Functions and Appl

Cryptographic Boolean Functions and Applications || Fourier analysis of Boolean functions

✍ 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