Approximate algorithms for minimization of binary decision diagrams on the basis of linear transformations of variables

dc.contributor.author	Kolpakov A.
dc.contributor.author	Latypov R.
dc.date.accessioned	2018-09-17T20:07:56Z
dc.date.available	2018-09-17T20:07:56Z
dc.date.issued	2004
dc.identifier.issn	0005-1179
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/133074
dc.description.abstract	Algorithms for an approximate minimization of binary decision diagrams (BDD) on the basis of linear transformations of variables are proposed. The algorithms rely on the transformations of only adjacent variables and have a polynomial complexity relative to the size of the table that lists values of the function involved.
dc.relation.ispartofseries	Automation and Remote Control
dc.title	Approximate algorithms for minimization of binary decision diagrams on the basis of linear transformations of variables
dc.type	Article
dc.relation.ispartofseries-issue	6
dc.relation.ispartofseries-volume	65
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	938
dc.source.id	SCOPUS00051179-2004-65-6-SID84904240130

Files in this item

Name: SCOPUS00051179-20 ...

Size: 43.25Kb

Format: PDF

Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.