Complexity of sequential implementation of partial Boolean functions

Complexity of sequential computations of

Complexity of sequential computations of partial Boolean functions by circuits

✍ L. A. Sholomov 📂 Article 📅 2008 🏛 Pleiades Publishing 🌐 English ⚖ 785 KB

Complexity of Boolean Functions

✍ Wegener I. 📂 Library 📅 1991 🌐 English ⚖ 2 MB

Presents a large number of recent research results previously unavailable in book form. Initially deals with the wee-known computation models, and goes on to special types of circuits, parallel computers, and branching programs. Includes basic theory as well recent research findings. Each chapter in

Compositional complexity of Boolean func

Compositional complexity of Boolean functions

✍ Harold Abelson; Andrzej Ehrenfeucht; James Fickett; Jan Mycielski 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 549 KB

Computational complexity of Boolean func

Computational complexity of Boolean functions

✍ Korshunov, Aleksei D 📂 Article 📅 2012 🏛 Turpion Limited 🌐 English ⚖ 965 KB

The complexity of Boolean functions

✍ Ingo Wegener 📂 Library 📅 1991 🏛 Wiley 🌐 English ⚖ 842 KB

Presents a large number of recent research results previously unavailable in book form. Initially deals with the wee-known computation models, and goes on to special types of circuits, parallel computers, and branching programs. Includes basic theory as well recent research findings. Each chapter in

Representation of partial Boolean functi

Representation of partial Boolean functions

✍ I. I. Brona 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 112 KB