On representation of Boolean functions by repetition-free formulas in some symmetric bases

Бесплатный доступ

We study representation of Boolean functions by formulas. We founded repetition-free criterions of Boolean functions in bases {v, -, -, 0, \,x\-...-xn v xl-...-xn}, where n~ uneven number is greater than 1.

Короткий адрес: https://sciup.org/148178186

IDR: 148178186

Статья научная