Asymptotically best method for synthesis of Boolean recursive circuits

References

[1] Shannon C., “A symbolic analysis of relay and switching circuits”, Trans. Amer. Inst. Electr. Engineers, 57 (1938), 713-723.10.1109/T-AIEE.1938.5057767Search in Google Scholar

[2] Lupanov O. B., Asymptotic complexity estimates for control systems, Moscow State Univ., Moscow, 1984 (in Russian).Search in Google Scholar

[3] Red'kin N. P., Markovskij A. B., “On the implementation of Boolean functions by circuits of blocks”, Problemy kibernetiki, 1974, ? 28, 81-100 (in Russian).Search in Google Scholar

[4] Lozhkin S. A., “High accuracy estimates for the complexity of control systems from some classes”, Matematicheskie voprosy kibernetiki, 1996, ? 6, 189-214 (in Russian).Search in Google Scholar

[5] Lozhkin S. A., High accuracy asymptotic estimates for the complexity of control systems, Thesis for the degree of doctor of phys.-math. sciences, Lomonosov Moscow State University, 1997 (in Russian).Search in Google Scholar

[6] Dancík V., “Complexity of Boolean functions with unbounded fan-in gates”, Inform. Proc. Letters, 57 (1996), 31-34.10.1016/0020-0190(95)00182-4Search in Google Scholar

[7] Nechiporuk E. I., “On the complexity of circuits in some bases containing nontrivial elements with zero weights”, Problemy Kibernetiki, 1962, ? 8, 123-160 (in Russian).Search in Google Scholar

[8] Gribok S. V., “On a model of recursive circuits”, Vestn. Mosk. un-ta. Ser. 15. Vychisl. matem. i kibern., 2002, N^o 4, 31-36 (in Russian).Search in Google Scholar

[9] Gribok S. V., On the implementation of algebra logic functions in some classes of programs, Thesis for the degree of candidate of phys.-math. sciences, Lomonosov Moscow State University, 2003 (in Russian), 90 pp.Search in Google Scholar

[10] Kasim-Zade O. M., “On the implementation complexity of functions in one class of algorithms”, Mater. IX interstate. school-seminar “Synthesis and complexity of control systems ”, M.: Izd-vo mekh.-matem. f-ta MGU, 1999, 25-30 (in Russian).Search in Google Scholar

[11] Kuz'min V. A., “Complexity estimate of the implementation of algebra logic functions by the simplest types of binary programs. Discrete analysis methods in the theory of codes and circuits”, Sb. trudov In-ta matem. SO AN USSR, 1976, N^o 29, 11-39 (in Russian).Search in Google Scholar

[12] Blinov S. V., Lozhkin S. A., “On the synthesis of recursive schemes from functional elements with a limited depth of recursion”, XIII Intern. sem. “Discrete mathematics and its applications”, M.: Izd-vo mekh.-matem. f-ta MGU, 2012, 98-99 (in Russian).Search in Google Scholar

[13] Zhukov V. V., “The asymptotically best method for synthesizing limited-depth Boolean recursive schemes”, Moscow Univ. Comput. Math. Cyber., 41:3 (2017), 134-141.10.3103/S0278641917030086Search in Google Scholar

[14] Lozhkin S. A., Lectures on the foundations of cybernetics, M.: Izd. otdel f-ta VMK MGU, 2004 (in Russian), 147 pp.Search in Google Scholar

[15] Yablonskii S. V., Elements of mathematical cybernetics, M.: Vysshaya shkola, 2007 (in Russian), 188 pp.Search in Google Scholar