DOI: 10.26907/2541-7746.2020.3
Ablayev M.F., Salikhova N.M. Quantum search for a given substring in the text using a hashing technique
241
Ablayev F.M., Ziatdinov M.T. Universal hash functions from quantum procedures
259
Andreeva T.V., Semenov Yu.S. On the cardinality of layers in some partially ordered sets
269
Baliuk A.S. The complexity of pseudo-Kronecker and free-Kronecker forms of functions over finite fields
285
Korneev S.A. On the asymptotic behavior of Shannon-type functions characterizing the computing complexity of systems of monomials
300
Kochergin V.V., Mikhailovich A.V. Bounds of non-monotone complexity for the multi-valued logic functions
311
Lozhkin S.A., Zizov V.S. Refined estimates of the decoder complexity in the model of cellular circuits with functional and switching elements
322
Lozhkin S.A., Kinzhikeyeva D.S. On the structure, complexity, and depth of the circuits over the basis {&,˅} realizing step Boolean functions
335
Popkov K.A. On the implementation of Boolean functions by contact circuits with uniform width 3
350
Temerbekova G.G., Romanov D.S. On single detection test sets under replacements of gates with inverters
359
Khadiev K.R., Lin D.I. Quantum online algorithms for a model of the request-answer game with a buffer
367
Для улучшения работы сайта и его взаимодействия с пользователями мы используем файлы cookie. Продолжая работу с сайтом, Вы разрешаете использование cookie-файлов. Вы всегда можете отключить файлы cookie в настройках Вашего браузера.
