KIAM Main page Web Library  •  Publication Searh  Русский 

Conference material: "Academician O.B. Lupanov XIV International Scientific Seminar "Discrete Mathematics and Its Applications" (20-25 June 2022, Moscow)"
Authors: Pimenov N.V., Lozhkin S.A.
Bounds of circuit complexity and dynamic activity for some class of bases
For functions of the algebra of logic in variables n, n = 1, 2, ..., asymptotically optimal in complexity from linear to dynamic activity of a circuit of functional elements in an arbitrary final complete basis B, in which among its functional elements, having the minimum reduced weight, or at least one of them implements FAL that has an isolated zero, and at least one implements a FAL that has isolated unit, or in the first (second) of the indicated cases an isolated zero (respectively, a unit) is a zero (respectively, a single) set.
boolean circuits, dynamic activity
Publication language: russian,  pages: 2 (p. 87-88)
Russian source text:
Export link to publication in format:   RIS    BibTeX
About authors:
  • Pimenov Nikita Vladimirovich,  Lomonosov Moscow State University
  • Lozhkin Sergey Andreevich,  Lomonosov Moscow State University