Time complexity analysis of generalized decomposition algorithm

Kalganova, T; Pshibytko, V

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/2506

Full metadata record

DC Field	Value	Language
dc.contributor.author	Kalganova, T	-
dc.contributor.author	Pshibytko, V	-
dc.coverage.spatial	5	en
dc.date.accessioned	2008-07-18T14:45:10Z	-
dc.date.available	2008-07-18T14:45:10Z	-
dc.date.issued	1997	-
dc.identifier.citation	Proceeding of the 19th International Scientific Symposium of Students and Young Research Workers. Zielona Gora, Poland, 1997. pp.145-149.	en
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/2506	-
dc.description.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.	en
dc.format.extent	542449 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	Committees of International Scientific Symposium of Students and Young Research Workers	en
dc.subject	Decomposition algorithm; r-valued functions; generalized disjunctive decomposition	en
dc.title	Time complexity analysis of generalized decomposition algorithm	en
dc.type	Conference Paper	en
Appears in Collections:	Electronic and Computer Engineering Dept of Electronic and Electrical Engineering Research Papers

Files in This Item:

File	Description	Size	Format
1997_kalganova_zelenogor2_97.pdf		529.74 kB	Adobe PDF	View/Open

Show simple item record