✦ LIBER ✦

Disjunctive normal forms of Boolean functions with a small number of zeros

✍ Scribed by A.Yu. Kogan

Publisher: Elsevier Science
Year: 1987
Weight: 444 KB
Volume: 27
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(87)90102-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On lower bounds for the complexity of di

On lower bounds for the complexity of disjunctive normal forms of Boolean functions with a small number of zeros

✍ A.Yu. Kogan 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 510 KB

Local algorithms simplifying the disjunc

Local algorithms simplifying the disjunctive normal forms of Boolean functions

✍ A.V. Kabulov; G.F. Losev 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 534 KB

A new normal form of Boolean functions

✍ Akio Odaka; Hiroaki Fujita; Susumu Nojima; Hiroshi Narushima 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 329 KB

Wratsuka, normal form of Eoolc in functions based on the swn (mod 2), product anid n is presented. Let = il. 2, . . . . n 1, let A, be the family of sc'ement subsets of a hen every Boolean function fix,, x3 . ..\* x 4 has a normal form with 6.l tique coefficients dkj e {O, 1). .A tr~nsf(3rm~tion of

A method of synthesizing planar disjunct

A method of synthesizing planar disjunctive normal forms for logical algebra functions

✍ Yu.A. Mamatov 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 191 KB

Representation of Boolean functions with

Representation of Boolean functions with a predetermined number of zeros by systems of linear inequalities

✍ L.I. Lipkin 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 212 KB

The best local algorithm for constructin

The best local algorithm for constructing the sum of minimal-essential disjunctive normal forms of a boolean function, using neighbourhoods of minimal order

✍ G.F. Losev 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 743 KB