Essential arity gap of Boolean functions
Discrete Mathematics
2008-10-13 v2
Abstract
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.
Keywords
Cite
@article{arxiv.0808.3892,
title = {Essential arity gap of Boolean functions},
author = {Slavcho Shtrakov},
journal= {arXiv preprint arXiv:0808.3892},
year = {2008}
}
Comments
12 pages, J. of Computing, Serdika, IMI, BAS, Sofia