- Full text PDF available (3)
- This year (0)
- Last 5 years (0)
- Last 10 years (1)
Journals and Conferences
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring programs: one exact, and another one based on heuristics which can give, however, provably exact results on some types of graphs. These programs were incorporated into the… (More)
This is a review paper that presents work done at Portland State University and associated groups in years 1989 2001 in the area of functional decomposition of multi-valued functions and relations, as well as some applications of these methods.
| Finding column multiplicity index is one of important component processes in functional decomposition of discrete functions for circuit design and especially Data Mining applications. How important it is to solve this problem exactly from the point of view of the minimum complexity of decomposition, and related to it error in Machine Learning type of… (More)