Article
Licensed
Unlicensed
Requires Authentication
Asymptotic bounds for the affinity level for almost all Boolean functions
-
M. L. Buryakov
Published/Copyright:
December 15, 2008
Abstract
We consider the asymptotic behaviour of one of the parameters of the Boolean functions known as the affinity level. We show that almost all Boolean functions of n variables have the generalised affinity level exceeding n – α log2n, α > 1, obtain an asymptotic upper bound for the partial affinity level, consider the asymptotic behaviour of the affinity level for the quadratic Boolean functions.
Received: 2008-06-10
Published Online: 2008-12-15
Published in Print: 2008-December
© de Gruyter 2008
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Random graphs of Internet type and the generalised allocation scheme
- Limit distributions of the number of vectors satisfying a linear relation
- On design of circuits of logarithmic depth for inversion in finite fields
- The order of communication complexity of PIR-protocols
- On start states of an automaton model of lung in pure environment
- A solution of the power conjugacy problem for words in the Coxeter groups of extra large type
- Asymptotic bounds for the affinity level for almost all Boolean functions
- A lower bound for the affinity level for almost all Boolean functions
Articles in the same Issue
- Random graphs of Internet type and the generalised allocation scheme
- Limit distributions of the number of vectors satisfying a linear relation
- On design of circuits of logarithmic depth for inversion in finite fields
- The order of communication complexity of PIR-protocols
- On start states of an automaton model of lung in pure environment
- A solution of the power conjugacy problem for words in the Coxeter groups of extra large type
- Asymptotic bounds for the affinity level for almost all Boolean functions
- A lower bound for the affinity level for almost all Boolean functions
