**The XV International Conference "Problems of Theoretical Cybernetics" ** |
5 |

*Ablayev F.M. *On Complexity of Classical Simulation of Quantum Branching Programs |
7 |

*Alekseev V.B. *On Some Closed Classes of Self-dual Partial Many-valued Functions |
16 |

*Alekhina M.A., Vasin A.V. *On the Circuits Reliability in Bases of Functions of No More Than Three Variables |
25 |

*Voronenko A.A., Chistikov D.V. *Learning Read-Once Functions Individually |
36 |

*Gainutdinova A.F. *Quantum and Classical Simulation of Quantum Branching Programs |
45 |

*Dainiak A.B. *On the Number of Independent Sets in Perfect *q*-ary Trees |
59 |

*Dudakova O.S. *Classes of Functions of the *k*-valued Logic Monotone with respect to Partially Ordered Sets |
65 |

*Evdokimov A.A. *Embeddings from the Class of Parametric Mappings of Bounded Distortion |
72 |

*Zhiltsova L.P. *On a Matrix of First Moments for Decomposable Stochastic CF-Grammar |
80 |

*Kuznetsov I.A., Romanov D.S. *On Full Checking Tests under Local Glueings of Variables in Boolean Functions |
90 |

*Lozhkin S.A., Vlasov N.V. *On Multiplexer Function Complexity in the π-schemes Class |
98 |

*Mubarakzjanov R.G. *On the Complexity of Randomized Read-once Branching Programs |
107 |

*Panteleyev V.I. *Special Expansions of Underdetermined Partial Boolean Functions |
114 |

*Peryazev N.A. *Clones, Co-Clones, Hyperclones and Superclones |
120 |

*Razinkov E.V., Latypov R.Kh. *Security of Steganographic Systems |
126 |

*Redkin N.P. *On the Synthesis of Schemes Permitting Short Tests and on the Estimates of the Test Lengths |
133 |

*Sapozhenko A.A. *On the Number of Sum-free Sets |
139 |

*Selezneva S.N., Markelov N.K. *Fast Algorithm for Building Polarized Polynomial Coefficients' Vectors of k-valued Functions |
147 |

*Chugunova V.V. *About Circuit Reliability in Full Bases, Containing a Vote Function with Input Inverse Failures |
154 |

*Shiganov A.E. *On Complexity of Oriented Contact Circuits with Limited Out-degree |
164 |

*Shupletsov M.S. *High Accuracy Asymptotic Bounds for Predicate Circuits over a Class of Specific Predicate Bases |
173 |