KIAM Main page Web Library  •  Publication Searh   
Publication

Article collection "Mathematical Problems of Cybernetics" 11, Moscow, 2002
Authors: Kochergina G.A.
On the complexity of the realization of elementary conjunctions and disjunctions by schemes in some complete bases
Abstract:
The article provides precise values of circuit complexity for elementary conjunctions and elementary disjunctions realized by logic circuits with gates from a complete basis belonging to a certain class.
Keywords:
circuit complexity, elementary conjunctions, elementary disjunctions, complete bases
Publication language: russian,  pages: 28 (p. 219-246)
Research direction:
Mathematical problems and theory of numerical methods
Russian source text:
List of publications citation:
Export link to publication in format:   RIS    BibTeX
About authors:
  • Kochergina Galina Anatolevna,  -