 |
|
|
|
|
 |
 |
|
Monotone Modulo-m Functions: Using Mathematica to Find the Number of Monotone Modulo-m Functions for v Number of Variables
|
|
|
|
|
|
| Organization: | Columbus State University |
|
|
|
|
|
|
2006 Wolfram Technology Conference
|
|
|
|
|
|
Champaign IL
|
|
|
|
|
|
Every set of Boolean Functions of v variables has a subset of functions called Monotone Boolean Functions of v variables. A Boolean function m belongs to this subset if and only if
a <= b -> m[a] <= m[b]
In 1897, Richard Dedekind asked the question: How many Monotone Boolean Functions of a given number of variables are there?
|
|
|
|
|
|
|
|
|
|
|
|
boolean functions
|
|
|
 |
|
|
| TechConf2006_Obando_presentation.nb (946.1 KB) - Mathematica Notebook [for Mathematica 5.2] |
|
|
For the newest resources, visit Wolfram Repositories and Archives »
