Please use this identifier to cite or link to this item:
Title: Time complexity analysis of generalized decomposition algorithm
Authors: Kalganova, T
Pshibytko, V
Keywords: Decomposition algorithm; r-valued functions; generalized disjunctive decomposition
Issue Date: 1997
Publisher: Committees of International Scientific Symposium of Students and Young Research Workers
Citation: Proceeding of the 19th International Scientific Symposium of Students and Young Research Workers. Zielona Gora, Poland, 1997. pp.145-149.
Abstract: The time complexity of the fast algorithm for generalized disjunctive decomposition of an rvalued function is studied.The considered algorithm to find the best decomposition is based on the analysis of multiple-terminal multiple-valued decision diagrams. It is shown that the time complexity for random rvalued functions depends on the such restriction as the number n1 of inputs in the first level circuit. In the case where the best partition of input variables is searched with restriction the time complexity is reduced in several times. The algorithm was simulated on a digital computer. The experimental results are in agreement with the theoretical predictions.
Appears in Collections:Electronic and Computer Engineering
Dept of Electronic and Computer Engineering Research Papers

Files in This Item:
File Description SizeFormat 
1997_kalganova_zelenogor2_97.pdf529.74 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.