Relations between energy complexity measures of Boolean networks and positive sensitivity of Boolean functions
-
Mikhail A. Mestetskiy
und
Mikhail S. Shupletsov
Abstract
We study relationships between lower estimates for the energy complexity E(Σ), the switching complexity S(Σ) of a normalized Boolean network Σ, and the positive sensitivity ps(f) of the Boolean function f implemented by this circuit. The lower estimate
Originally published in Diskretnaya Matematika (2023) 35, №1, 71–81 (in Russian).
References
[1] Lozhkin S. A., Shupletsov M. S., “On the dynamic activity of circuits from functional elements and the construction of circuits with linear dynamic activity that are asymptotically optimal in complexity”, Uchen. zap. Kazan. un-ta. Ser. Fiz.-matem. nauki, 156:3 (2014), 84–97 (in Russian).Suche in Google Scholar
[2] Sima J., “Energy complexity of recurrent neural networks”, Neural Comput., 26:5 (2014), 953–973.10.1162/NECO_a_00579Suche in Google Scholar PubMed
[3] Uchizawa K., Takimoto E., “Exponential lower bounds on the size of constant-depth threshold circuits with small energy com-plexity”, Theor. Comput. Sci., 407:1–3 (2008), 474–487.10.1016/j.tcs.2008.07.028Suche in Google Scholar
[4] Vaı̆ncvaı̆g M. N., “On the power of networks of functional elements”, Soviet Physics Dokl., 6 (1961), 545–547.Suche in Google Scholar
[5] Kasim-Zade O. M., “On a measure of the complexity of schemes of functional elements”, Sov. Math., Dokl., 21 (1980), 203–206.Suche in Google Scholar
[6] Kasim-Zade O. M., “On simultaneous minimization of complexity and power of circuits from functional elements”, Problems of cybernetics, 33 (1978), 215–220 (in Russian).Suche in Google Scholar
[7] Dinesh K., Otiv S., Sarma J., “New bounds for energy complexity of Boolean functions”, Theor. Comput. Sci., 845 (2022), 59–75.10.1016/j.tcs.2020.09.003Suche in Google Scholar
[8] Lozhkin S. A., Lectures on the basics of cybernetics, VMK MGU, 2017 (in Russian).Suche in Google Scholar
© 2024 Walter de Gruyter GmbH, Berlin/Boston
Artikel in diesem Heft
- Frontmatter
- On large deviations of the moment of attaining far level by the random walk in a random environment
- Asymptotic local lower deviations of strictly supercritical branching process in a random environment with geometric distributions of descendants
- Cloning operations and graph diameter
- Relations between energy complexity measures of Boolean networks and positive sensitivity of Boolean functions
- On the maximal size of tree in a random forest
- Deciding multiaffinity of polynomials over a finite field
- Probability that given vertices belong to the same connected component of random equiprobable mapping
Artikel in diesem Heft
- Frontmatter
- On large deviations of the moment of attaining far level by the random walk in a random environment
- Asymptotic local lower deviations of strictly supercritical branching process in a random environment with geometric distributions of descendants
- Cloning operations and graph diameter
- Relations between energy complexity measures of Boolean networks and positive sensitivity of Boolean functions
- On the maximal size of tree in a random forest
- Deciding multiaffinity of polynomials over a finite field
- Probability that given vertices belong to the same connected component of random equiprobable mapping
