Adjacency Graph of the SNF as Source of Information

@inproceedings{Freiberg2006AdjacencyGO,
title={Adjacency Graph of the SNF as Source of Information},
author={Bernd Steinbach Freiberg},
year={2006}
}

Bernd Steinbach Freiberg

Published 2006

The Specialized Normal Form (SNF) is a unique (canonical) representation of Exclusive Sum-Of-Products (ESOP) expressions of a Boolean function. The adjacency graph of the SNF takes the cubes of the SNF as labels of the vertices and connects such vertices by an edge which differ exactly in one variable of the associated cubes. It is known that each adjacency graph of the SNF of a Boolean function f : B → B is a k-regular graph. This paper shows, how differences between the vertices of this graph… CONTINUE READING

Lukac : On SNF Optimization : a functional comparison of methods

V. Yanchurkin B. Steinbach, M.

Proceedings of the 6 th International Symposium…

2003

Towards a General Novel Exact ESOP Minimization Methodology, in: Proceedings of the 6th International Symposium on Representations and Methodology of Future Computing Technology (RM

S. Stergios, P. George

2003

1 Excerpt

Algorithm to derive minimum ESOP for 6-variable function, in: B. Steinbach: Boolean Problems

A. Gaidukov

Proceedings of the 5th International Workshops on…

2002

1 Excerpt

Perkowski : A Fast Algorithm to Minimize MultiOutput MixedPolarity Generalized ReedMuller Forms