Minimal contact circuits for characteristic functions of spheres
-
Nikolay P. Reďkin
Abstract
We study the complexity of implementation of the characteristic functions of spheres by contact circuits. By the characteristic functions of the sphere with center at a vertex σ̃ = (σ1, …, σn), σ1, …, σn ∈ {0, 1}, we mean the Boolean function
Note: Originally published in Diskretnaya Matematika (2020) 32,№3, 68–75 (in Russian).
-
Funding: This research was carried out with the financial support of the Russian Foundation for Basic Research (grant no. 18-01-00337).
References
[1] Yablonsky S. V., “Basic Concepts of Cybernetics”, Problemy kibernetiki, 2 (1959), 7–38 (in Russian).Search in Google Scholar
[2] Shannon C. E., Papers on Information Theory and Cybernetics, IL, Moscow, 1963 (in Russian).Search in Google Scholar
[3] Lupanov O. B., Asymptotic bounds on complexity of control systems, Izd. Moskov. Univ., Moscow, 1984 (in Russian), 138 pp.Search in Google Scholar
[4] Cardot C., “Quelques résultats sur ľapplication de ľalgebre de Boole à la synthèse des circuits à relais”, Ann. Télécomm., 7:2 (1952), 75–84.10.1007/BF03017104Search in Google Scholar
© 2021 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Frontmatter
- A method of construction of differentially 4-uniform permutations over Vm for even m
- Ergodicity of the probabilistic converter, a serial connection of two automata
- On distance-regular graphs with c2 = 2
- Minimal contact circuits for characteristic functions of spheres
- Approximation of restrictions of q-valued logic functions to linear manifolds by affine analogues
- Multiaffine polynomials over a finite field
- Large deviations of branching process in a random environment. II
Articles in the same Issue
- Frontmatter
- A method of construction of differentially 4-uniform permutations over Vm for even m
- Ergodicity of the probabilistic converter, a serial connection of two automata
- On distance-regular graphs with c2 = 2
- Minimal contact circuits for characteristic functions of spheres
- Approximation of restrictions of q-valued logic functions to linear manifolds by affine analogues
- Multiaffine polynomials over a finite field
- Large deviations of branching process in a random environment. II
