✦ LIBER ✦

A lower estimate of the complexity of three-valued logic functions in the class of polarized polynomials

✍ Scribed by N. K. Markelov

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of boolean functions in a cla

✍ A. N. Alekseichuck 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 306 KB

On the complexity of polarised polynomia

✍ Selezneva, S.N. 📂 Article 📅 2004 🏛 Walter de Gruyter GmbH & Co. KG 🌐 English ⚖ 33 KB

On the complexity of generalized polynom

✍ S. N. Selezneva; A. B. Dainyak 📂 Article 📅 2008 🏛 Allerton Press, Inc. 🌐 English ⚖ 157 KB

Complexity of Boolean functions in the c

✍ N. A. Peryazev 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 149 KB

The complexity of dynamic tests for func

✍ V. A. Vardanyan 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 753 KB

Structure of clones in the precomplete c

✍ D. N. Zhuk 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 237 KB