✦ LIBER ✦

On the complexity of planar Boolean circuits

✍ Scribed by György Turán

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

Modelling the complexity of parallel and

✍ Constantinos V. Papadopoulos; Theodoros S. Andronikos 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 706 KB

The Monotone Circuit Complexity of Quadr

✍ Kazuyuki Amano; Akira Maruoka 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 180 KB

The Complexity of the Descriptiveness of

✍ Elmar Bohler; Henning Schnoor 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 366 KB

Lower bounds of the complexity of symmet

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

On the combinational complexity of certa

✍ Larry J. Stockmeyer 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 757 KB