The asymptotically best method for synthesizing limited-depth Boolean recursive schemes

Moscow University Computational Mathematics and Cybernetics - Tập 41 Số 3 - Trang 134-141 - 2017
V. V. Zhukov1
1Faculty of Computational Mathematics and Cyberntics, Moscow State University, Moscow, 119991, Russia

Tóm tắt

Từ khóa


Tài liệu tham khảo

O. B. Lupanov, Asymptotic Estimates for the Complexity of Control Systems (Mosk. Gos. Univ., Moscow, 1984) [in Russian].

N. P. Red’kin and A. B. Markovskii, “On realization of Boolean functions by circuit of blocks,” in Problems of Cybernetics (Nauka, Moscow, 1974), No. 28, pp. 81–100 [in Russian].

S. V. Gribok, “On one model of recursive schemes of functional elements,” Vestn. Mosk. Univ., Ser. 15: Vychisl. Mat. Kibern., No. 4, 31–36 (2002).

S. V. Blinov and S. A. Lozhkin, “On synthesis of recursive schemes of functional elements with limited recursion depth,” in Proceedings of the 11th International Seminar on Discrete Mathematics and its Applications (Mosk. Gos. Univ., Moscow, 2012), pp. 98–99.

S. A. Lozhkin, Lectures on Principles of Cybernetics (Mosk. Gos. Univ., Moscow, 2004) [in Russian].

S. V. Yablonskii, Elements of Mathematical Cybernetics (Vyssh. Shkola, Moscow, 2007) [in Russian].