On implementation of Boolean functions by contact circuits of minimal uniform width
-
Kirill A. Popkov
Abstract
For each Boolean function, we find a minimal possible value of the uniform width of a contact circuit implementing this function. We also show that, for almost all n-place Boolean functions, this value is equal to 3.
Originally published in Diskretnaya Matematika (2021) 33, №4, 94–109 (in Russian).
References
[1] Lupanov O.B., Asymptotic bounds on complexity of control systems, M.: Izd-vo Mosk. un-ta, 1984 (in Russian), 138 pp.Search in Google Scholar
[2] Shannon C. E., “A symbolic analysis of relay and switching circuits”, Trans. AIEE, 57 (1938), 713–723.10.1109/EE.1938.6431064Search in Google Scholar
[2] Shannon C. E., “The synthesis of two-terminal switching circuits”, Bell Syst. Tech. J, 28:1 (1949), 59–98.10.1002/j.1538-7305.1949.tb03624.xSearch in Google Scholar
[4] Korshunov A. D., “Computational complexity of Boolean functions”, Russian Math. Surveys, 67:1 (2012), 93–165.10.1070/RM2012v067n01ABEH004777Search in Google Scholar
[5] Madatyan Kh. A., “Synthesis of contact circuits of limited width”, Problemy kibernetiki, 14, M.: Nauka, 1965, 301–307 (in Russian).Search in Google Scholar
[6] Karpova N. A., “On calculations with limited memory”, Matematicheskie voprosy kibernetiki, 2, M.: Nauka, 1989, 131–144 (in Russian).Search in Google Scholar
[7] Okol’nishnikova E. A., “On the complexity of branching programs”, Matematicheskie voprosy kibernetiki, 10, M.: Nauka, 2001, 69–82 (in Russian).Search in Google Scholar
[8] Lozhkin S.A., Lectures on the Fundamentals of Cybernetics (Textbook for Students), M.: Izd-vo Mosk. un-ta, 2004 (in Russian), 147 pp.Search in Google Scholar
[9] Konovodov V. A., “On synthesis of circuits with bounded width”, Proc. VIII Youth Sci. Workship on Discrete Math. and Its Appl. (Moscow, Oct. 24-29, 2011), Moscow, 2011, 37–41 (in Russian).Search in Google Scholar
[10] Kravtsov S. S., “On the implementation of algebra of logic functions in a class of circuits of functional and switching elements”, Problemy kibernetiki, 19, 1967, 285–293 (in Russian).Search in Google Scholar
[11] Popkov K. A., “On the implementation of Boolean functions by contact circuits with uniform width 3”, Uchenye zapiski Kazansk. un-ta. Ser. Fiz.-matem. nauki, 162:3 (2020), 350–358 (in Russian).10.26907/2541-7746.2020.3.350-358Search in Google Scholar
[12] Red’kin N. P., Reliability and diagnostics of circuits, M.: Izd-vo Mosk. un-ta, 1992 (in Russian), 192 pp.Search in Google Scholar
[13] Popkov K. A., “On implementation of Boolean functions by contact circuits with constant uniform width”, Dokl. Math., 102:3 (2020), 502–504.10.1134/S1064562420060150Search in Google Scholar
© 2022 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Some cardinality estimates for the set of correlation-immune Boolean functions
- Invertible matrices over some quotient rings: identification, generation, and analysis
- Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs
- Contents
- On a class of irregular languages
- On the membership problem for finite automata over symmetric groups
- On the asymptotic normality conditions for the number of repetitions in a stationary random sequence
- On implementation of Boolean functions by contact circuits of minimal uniform width
- Retraction
- Some cardinality estimates for the set of correlation-immune Boolean functions
- Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs
- Invertible matrices over some quotient rings: identification, generation, and analysis
Articles in the same Issue
- Some cardinality estimates for the set of correlation-immune Boolean functions
- Invertible matrices over some quotient rings: identification, generation, and analysis
- Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs
- Contents
- On a class of irregular languages
- On the membership problem for finite automata over symmetric groups
- On the asymptotic normality conditions for the number of repetitions in a stationary random sequence
- On implementation of Boolean functions by contact circuits of minimal uniform width
- Retraction
- Some cardinality estimates for the set of correlation-immune Boolean functions
- Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs
- Invertible matrices over some quotient rings: identification, generation, and analysis
