DocumentCode
2066231
Title
Investigation of algorithm for minimization of Boolean functions by clusterization
Author
Melnyk, Roman ; Luchkows´ky, Olexandr
Author_Institution
Lviv Polytech. Nat. Univ., Ukraine
fYear
2004
fDate
28-28 Feb. 2004
Firstpage
49
Lastpage
51
Abstract
The approach for the logical functions decomposition on and the base of fuzzy reduction tree or fuzzy clusterization is considered. The properties of the optimal reduction tree method for graphs and logical sentences are described. Experimental results show that the time of minimization for this method was considerably multiplied at approaching amount of function values to the maximally possible amount for the set dimension of Boolean function.
Keywords
Boolean functions; fuzzy set theory; minimisation; pattern clustering; trees (mathematics); Boolean functions; fuzzy clusterization; fuzzy reduction tree methods; graph theory; logical functions decomposition; minimization; Acceleration; Aggregates; Boolean functions; Clustering algorithms; Fuzzy logic; Graphics; Hypercubes; Minimization methods; Ribs; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Modern Problems of Radio Engineering, Telecommunications and Computer Science, 2004. Proceedings of the International Conference
Conference_Location
Lviv-Slavsko, Ukraine
Print_ISBN
966-553-380-0
Type
conf
Filename
1365866
Link To Document