1. Recognition algorithms based on computation of estimates

   • Yu. I. Zhuravlev
   • V. V. Nikiforov

   OriginalPaper Pages: 387 - 400

2. Calculating the probability of uniqueness of the solution of a system of random nonlinear Boolean equations

   • N. N. Kovalenko

   OriginalPaper Pages: 401 - 405

3. Elaboration of the asymptotic expressions for the average faultless-operation time

   • G. G. Men'shikov

   OriginalPaper Pages: 406 - 409

4. Rademacher-Walsh polynomials in approximation problems for functions of several variables

   • G. V. Gorbunov
   • É. S. Moskalev

   OriginalPaper Pages: 410 - 414

5. Signal preprocessor algorithm for recognition systems with similarity generalization

   • Yu. P. Pyt'ev

   OriginalPaper Pages: 415 - 424

6. Additive overflow in a residue class system

   • V. A. Vyshinskii

   OriginalPaper Pages: 425 - 428

7. Necessary minimum conditions in problems with operator constraints

   • B. N. Pshenichnyi
   • E. I. Nenakhov

   OriginalPaper Pages: 429 - 444

8. On a general problem of stochastic programming

   • Yu. M. Ermol'ev

   OriginalPaper Pages: 445 - 449

9. A minimization method using the operation of extension of the space in the direction of the difference of two successive gradients

   • N. Z. Shor
   • N. G. Zhurbenko

   OriginalPaper Pages: 450 - 459

10. Two problems of optimal allocation of production

    • A. M. Gal'perin

    OriginalPaper Pages: 460 - 471

11. A method of solution of a convex programming problem

    • V. N. Gordeev

    OriginalPaper Pages: 472 - 476

12. A theoretical analysis of pulse information processing by a neuron

    • A. G. Afanas'eva
    • Yu. I. Petunin

    OriginalPaper Pages: 477 - 486

13. Renewal processes with several types of renewal points

    • V. V. Rykov
    • M. A. Yastrebenetskii

    OriginalPaper Pages: 487 - 493

14. A generalization of the Ford-Fulkerson theorem to multipole networks

    • V. L. Kupershtokh

    OriginalPaper Pages: 494 - 502

15. Gradient method for the determination of saddle points under equality-type constraints

    • V. N. Gorbatenko

    OriginalPaper Pages: 503 - 512

16. ANALITIK (algorithmic language for the description of computing processes using analytical transformations)

    • V. M. Glushkov
    • V. G. Bodnarchuk
    • Yu. S. Fishman

    OriginalPaper Pages: 513 - 552

17. Mathematical models of the sentence. II

    • M. I. Beletskii

    OriginalPaper Pages: 553 - 558

18. Committees of systems of inequalities and the recognition problem

    • V. D. Mazurov

    OriginalPaper Pages: 559 - 567

19. Partitions and classification

    • N. N. Aizenberg
    • A. I. Tsitkin

    Brief Communications Pages: 568 - 569

20. Upper bound on the number of letters in a minimal formula of depth N of the function F=(x₁+...+x_n)mod 2

    • É. L. Baum

    Brief Communications Pages: 570 - 571

21. New directions in the study of elementary perceptrons

    • G. Gimel'farb
    • V. Sharypanov

    Book Reviews Pages: 572 - 574