Essential arity gap of Boolean functions

Simple item page
dc.creatorShtrakov, Slavcho
dc.date2008-08-28
dc.date2008-10-13
dc.date.accessioned2026-07-07T10:08:59Z
dc.date.available2026-07-07T10:08:59Z
dc.descriptionWe 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.
dc.description12 pages, J. of Computing, Serdika, IMI, BAS, Sofia
dc.identifierhttps://arxiv.org/abs/0808.3892
dc.identifierhttp://arxiv.org/abs/0808.3892
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/171186
dc.subjectDiscrete Mathematics
dc.subjectG.2.0
dc.titleEssential arity gap of Boolean functions
dc.typetext

Files

Collections

arXiv