Essential arity gap of Boolean functions

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We investigate the Boolean functions with essential arity gap 2. We use Full Conjunctive Normal Forms instead of Zhegalkin's polynomials, which allow us to simplify the proofs and to obtain several combinatorial results, concerning the Boolean functions with a given arity gap.
12 pages, J. of Computing, Serdika, IMI, BAS, Sofia

Citation

Consulte el texto completo en el siguiente enlace:

Collections