|
Search: id:A109003
|
|
|
| A109003 |
|
Number of equivalence classes of Boolean functions, that is, maps from GF(2)^n to GF(2), where maps f and g are equivalent iff one can be obtained from the other by a combination of (i) permuting the variables, (ii) complementing the variables, (iii) mapping f(x) to f(x) + b.x + c for a binary vector b and a binary scalar c. |
|
+0
2
|
| |
|
|
|
|
Search completed in 0.002 seconds
|
