Search
 
loader loading subjects...
cover
Conjectures on the Number of Balanced Boolean Functions of Bounded Degree
Thomas W. Cusick
97 - 103
10.3233/978-1-58603-878-6-97
NATO Science for Peace and Security Series - D: Information and Communication Security
Volume 18: Boolean Functions in Cryptology and Information Security
Abstract

We state several conjectures which provide good upper and lower bounds for the number of balanced Boolean functions in n variables with degree less than or equal to k. We give proofs for several special cases and give some reasons why we think that the conjectures are true. We believe that the conjectures will be very useful for further research.

$35.00 / €27.50 / £22.00
Add PDF to cart