Skip to main content
Article thumbnail
Location of Repository

CALCULATION COMPLEXITY FOR SOME SYSTEMS OF BOOLEAN FUNCTIONS BY SCHEMES FROM FUNCTIONAL ELEMENTS

By Konstantin Anatolievich Zykov

Abstract

The problem consideration in the field of mathematical cybernetics, theory of the synthesis and complexity of controlling systems is the aim of the paper as well as the investigation of the realization complexity for some systems of Boolean functions by schemes from functional elements in basises, containing a linear function. As a result the non-trivial linear lower estimation of the realization complexity for some systems of Boolean functions by schemes from functional elements has been proved. In the comparison of two realization methods for linear Boolean transformations it has been proved, that the complexity economy is possible more than for two times. The paper results may find their field of application in mathematical cybernetics, synthesis and complexity of controlling systemsAvailable from VNTIC / VNTIC - Scientific & Technical Information Centre of RussiaSIGLERURussian Federatio

Topics: 12A - Pure mathematics, MATHEMATICS
Year: 1992
OAI identifier:
Provided by: OpenGrey Repository
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/10068/35... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.