Essential arity gap of Boolean functions

Details Essential arity gap of Boolean functions Essential arity gap of Boolean functions

2008-08-28

arxiv.org/abs/0808.3892v2

Computer Science

Discrete Mathematics

12 pages, J. of Computing, Serdika, IMI, BAS, Sofia

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Essential arity gap of Boolean functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Essential arity gap of Boolean functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Essential arity gap of Boolean functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-327236