Метод би-декомпозиции частичной булевой функции | Прикладная дискретная математика. 2020. № 47. DOI: 10.17223/20710410/47/9

Perkowski M. A. and Grygiel S. A Survey of Literature on Functional Decomposition, Version IV (Technical Report). Portland, USA, Portland State University, Department of Electrical Engineering, 1995. 188 р

Cortadella J. Timing-driven logic bi-decomposition. IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 2003, vol. 22, no. 6, pp. 675-685

Mishchenko A., Steinbach B., and Perkowski M. An algorithm for bi-decomposition of logic functions. Proc. 38th Ann. Design Automation Conf., Las Vegas, NV, USA, ACM, June 2001, pp. 103-108

Chang S.-C., Marek-Sadowska M., and Hwang T. Technology mapping for TLU FPGA's based on decomposition of binary decision diagrams. IEEE Trans. Computer-Aided Design, 1996, vol. 15, no. 10, pp. 1226-1235

Bibilo P. N. Dekompozitsiya bulevykh funktsiy na osnove resheniya logicheskikh uravneniy [Decomposition of Boolean Functions Based on Solving Logical Equations]. Minsk, Belaruskaya Navuka, 2009. 211 p. (in Russian)

Zakrevskij A. D. On a special kind decomposition of weakly specified Boolean functions. Second Intern. Conf. CAD DD'97, Minsk, Republic of Belarus, November 12-14, 1997. Minsk, NAS of Belarus, Institute of Engineering Cybernetics, 1997, vol. 1, pp. 36-41

Cheng D. and Xu X. Bi-decomposition of logical mappings via semi-tensor product of matrices. Automatica, 2013, vol. 49, no. 7, pp. 1979-1985

Choudhury M. and Mohanram K. Bi-decomposition of large Boolean functions using blocking edge graphs. IEEE/ACM Intern. Conf. ICCAD, San Jose, CA, USA, IEEE Press, 2010, pp. 586-591

Fiser P. and Schmidt J. Small but nasty logic synthesis examples. Proc. IWSBP'8, Freiberg, Germany, Freiberg University of Mining and Technology, Sept. 2008, pp. 183-190

Steinbach B. and Posthoff C. Vectorial bi-decomposition for lattices of Boolean functions. Further Improvements in the Boolean Domain (ed. B. Steinbach). Cambridge Scholars Publishing, 2018, pp. 175-198

Pottosin Yu. V. and Shestakov E. A. Dekompozitsiya sistemy chastichnykh bulevykh funktsiy s pomoshch'yu pokrytiya grafa polnymi dvudol'nymi podgrafami [Decomposition of a system of partial Boolean functions with the help of covering a graph by complete bipartite subgraphs]. Proc. 2nd Conf. “New Information Technologies in the Study of Discrete Structures”, Yekaterinburg, UrS RAS, 1998, pp. 185-189. (in Russian)

Zakrevskij A. D., Pottosin Yu. V., and Cheremisinova L. D. Combinatorial Algorithms of Discrete Mathematics. Tallinn, TUT Press, 2008. 193 p

Pottosina S., Pottosin Yu., and Sedliak B. Finding maximal complete bipartite subgraphs in a graph. J. Appl. Math., 2008, vol. 1, no. 1, pp. 75-81