Decomposition of Boolean Relations and Functions in Logic Synthesis and Data Analysis

Authors:
Piotr Sapiecha;H. Selvaraj;M. Pleban
Affiliations:
-;-;-
Venue:
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Year:
2000

Citing 5
Cited 0

A new approach to the decomposition of incompletely specified multi-output functions based on graph coloring and local transformations and its application to FPGA mapping

EURO-DAC '92 Proceedings of the conference on European design automation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Machine Learning by Function Decomposition

ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
Decomposition of multiple-valued relations

ISMVL '97 Proceedings of the 27th International Symposium on Multiple-Valued Logic
Decomposition of Multiple-Valued Functions

ISMVL '95 Proceedings of the 25th International Symposium on Multiple-Valued Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows that the problem of decomposing a finite function f(A, B) into the form h(g(A),B), where g is a Boolean function, can be resolved in polynomial time, with respect to the size of the problem. It is also shown that omission of the characteristic of the g function can significantly complicate the problem. Such a general problem belongs to the NP-hard class of problems. The work shows how the problem of decomposition of a finite function can be reduced to the problem of coloring the vertices of a graph. It is also shown that the problem of decomposition of relations can be reduced to coloring the vertices of their hypergraphs. In order to prove the validity of the theorems, combinatory properties of Helly are used.