Article
Licensed
Unlicensed
Requires Authentication
Barriers of perfectly balanced Boolean functions
-
S. V. Smyshlyaev
Published/Copyright:
July 8, 2010
Abstract
We continue the study of properties of perfectly balanced Boolean functions with the use of the concept of barriers of Boolean functions.
Received: 2009-08-19
Published Online: 2010-07-08
Published in Print: 2010-July
© de Gruyter 2010
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- A limit theorem for the logarithm of the order of a random A-permutation
- On game-theoretic characterisation of stochastic independence
- On the potential divisibility of matrices over distributive lattices
- On learning monotone Boolean functions with irrelevant variables
- Barriers of perfectly balanced Boolean functions
- On the classification of Post automaton bases by the decidability of the A-completeness property for definite automata
Articles in the same Issue
- A limit theorem for the logarithm of the order of a random A-permutation
- On game-theoretic characterisation of stochastic independence
- On the potential divisibility of matrices over distributive lattices
- On learning monotone Boolean functions with irrelevant variables
- Barriers of perfectly balanced Boolean functions
- On the classification of Post automaton bases by the decidability of the A-completeness property for definite automata
