Effective Class of Discreet Programing Problems

Authors: Kaziyev G. Z., Nabiyeva G. S., Kalizhanova A.U.

Abstract:

We consider herein a concise view of discreet programming models and methods. There has been conducted the models and methods analysis. On the basis of discreet programming models there has been elaborated and offered a new class of problems, i.e. block-symmetry models and methods of applied tasks statements and solutions.

Keywords: Discreet programming, block-symmetry, analysis methods, information systems development.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1078485

References:

[1] Korbut ðÉ.ðÉ,, Filjkenshtein Yu.Yu. Disctreet programming. - ð£.:Nauka, 1969.
[2] Sigal I.Kh., Ivanova ðÉ.P. Introduction into applied discreet programming. ð£.: FIZMATLIT, 2002.
[3] Malyugin V.D.. Boolean functions implementation with arithmetical polynoms //Automation and telemechanics. - 1982. - #4.- p.73
[4] Drozdov N.A. Discreet programming algorithms. - Tverj.: Nauka, 2002.
[5] Kaziyev G.Z. Modular block-schemes synthesis in automated control systems // Automation and telemechanics. 1992. #11. p.p. 160-171.
[6] Kaziyev G.Z. Block-symmetry models and discreet programming settlement and solution methods. // Vestnik of RK Engineering Academy, #2(10) 2003, p.p. 55-59.