|
Avtomatika i Telemekhanika, 2004, Issue 6, Pages 112–128
(Mi at1592)
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers)
Decision Diagrams
Approximate algorithms for minimization of binary decision diagrams on the basis of linear transformations of variables
A. Kolpakov, R. Kh. Latypov Kazan State University
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.
Citation:
A. Kolpakov, R. Kh. Latypov, “Approximate algorithms for minimization of binary decision diagrams on the basis of linear transformations of variables”, Avtomat. i Telemekh., 2004, no. 6, 112–128; Autom. Remote Control, 65:6 (2004), 938–954
Linking options:
https://www.mathnet.ru/eng/at1592 https://www.mathnet.ru/eng/at/y2004/i6/p112
|
Statistics & downloads: |
Abstract page: | 180 | Full-text PDF : | 62 | References: | 43 | First page: | 2 |
|