✦ LIBER ✦

Lower bounds for the complexity of reliable Boolean circuits with noisy gates

✍ Scribed by Gacs, P.; Gal, A.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds on the area complexity of B

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

On a lower bound for the redundancy of r

✍ Pippenger, N.; Stamoulis, G.D.; Tsitsiklis, J.N. 📂 Article 📅 1991 🏛 IEEE 🌐 English ⚖ 513 KB

Lower bounds of the complexity of symmet

✍ A. A. Razborov 📂 Article 📅 1990 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 692 KB

An upper bound for the circuit complexit

✍ H. Kleine Büning; A. Remshagen 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 311 KB

On lower bounds for the complexity of di

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

Lower bounds for the non-linear complexi

✍ Michael D. Hirsch 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 687 KB