The number of Boolean functions computed
β
Petr SavickΓ½; Alan R. Woods
π
Article
π
1998
π
John Wiley and Sons
π
English
β 323 KB
π 2 views
Estimates are given of the number B n, L of distinct functions computed by propositional formulas of size L in n variables, constructed using only literals and n, k Ε½ connectives. L is the number of occurrences of variables. L y 1 is the number of binary ns Ε½ . and ks. B n, L is also the number of f