Studies of Euler diagrams/dukeli NP

The NP equivalence class of contains $$\frac{16 \cdot 24}{2} = 192$$ Boolean functions. It contains the complement of each function, which makes it a complete NPN equivalence class.

There are 16 &middot; 24 = 384 Euler diagrams. As they are mirror symmetric, each function is described by two of them.

Each Euler diagram is denoted by a of four elements. They are abbreviated by pairs $$\{ (m, n) \in \{0 ... 15\} \times \{0 ... 23\} \}$$.

The truth table corresponding to diagram (m, n) can be found in row m of matrix n in.

The obvious way to show them in a 16×24 matrix can be seen in valneg. Functions in the same column are in the same negation equivalence class

A more intuitive arrangement is shown in keyneg, where the rows have negated places (instead of negated values) in common. This adds the feature, that functions in the same row are in same permutation equivalence class.



But in the last arrangement the rows and columns forming the same equivalence class are not next to each other. This problem is solved in ordered.

That arrangement still contains duplicates, because it shows all possible Euler diagrams. A similar one without duplicates is the following, where the functions are represented by their Zhegalkin indices: