✦ LIBER ✦

The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates

✍ Scribed by Elmar Bohler; Henning Schnoor

Publisher: Springer
Year: 2007
Tongue: English
Weight: 366 KB
Volume: 41
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-006-1301-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of planar Boolean circ

On the complexity of planar Boolean circuits

✍ György Turán 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 1006 KB

Complexity of Boolean functions over bas

Complexity of Boolean functions over bases with unbounded fan-in gates

✍ Vlado Dančík 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 260 KB

The Complexity of Membership Problems fo

The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers

✍ Pierre McKenzie; Klaus W. Wagner 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 404 KB

Lower bounds on the area complexity of B

Lower bounds on the area complexity of Boolean circuits

✍ Juraj Hromkovič; Sergej A. Ložkin; Andrej I. Rybko; Alexander A. Sapoženko; Nade 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 1001 KB

The Complexity of Boolean Functions in D

The Complexity of Boolean Functions in Different Characteristics

✍ Parikshit Gopalan; Amir Shpilka; Shachar Lovett 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 573 KB

On the Design of Reliable Boolean Circui

On the Design of Reliable Boolean Circuits That Contain Partially Unreliable Gates

✍ Dan Kleitman; Tom Leighton; Yuan Ma 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 392 KB

We investigate a model of gate failure for Boolean circuits in which a faulty gate is restricted to output one of its input values. For some types of gates, the model, which we call the short-circuit model of gate failure, is weaker than the traditional von Neumann model in which faulty gates always