L. A. Levin, “Universal Sequential Search Problems”, Probl. Peredachi Inf., 9:3 (1973), 115–116; Problems Inform. Transmission, 9:3 (1973), 265

This publication is cited in the following 21 articles:

M. A. Posicelskaya, “Constructive combinatorics in elementary school mathematics”, Dokl. Math., 107:Suppl 1 (2023), S52–S77
M. Rybakov, “Computational complexity of the word problem in modal and pseudo-Boolean algebras with a small number of generators”, Russian Math. (Iz. VUZ), 66:5 (2022), 33–48
A. A. Semenov, K. V. Antonov, I. A. Gribanova, “Porozhdenie dopolnitelnykh ogranichenii v zadachakh algebraicheskogo kriptoanaliza pri pomoschi SAT-orakulov”, PDM. Prilozhenie, 2021, no. 14, 104–110
M. N. Rybakov, “Slozhnost problemy ravenstva slov v mnogoobraziyakh modalnykh algebr”, Vestnik TvGU. Seriya: Prikladnaya matematika, 2021, no. 3, 5–17
Vladimir V. Rybakov, “Satisfiability in Boolean logic (SAT problem) is polynomial”, Zhurn. SFU. Ser. Matem. i fiz., 14:5 (2021), 667–671
I. I. Batyrshin, “Asymptotic density and computability”, Russian Math. (Iz. VUZ), 65:10 (2021), 1–9
Liu Ya. Pass R., “On the Possibility of Basing Cryptography on Exp Not Equal Bpp”, Advances in Cryptology (Crypto 2021), Pt i, Lecture Notes in Computer Science, 12825, ed. Malkin T. Peikert C., Springer International Publishing Ag, 2021, 11–40
G. V. Safonov, G. V. Bokov, V. B. Kudryavtsev, “On irreduceability of Boolean functions with respect to commutative associative operation”, Moscow University Mathematics Bulletin, 75:4 (2020), 169–171
G. V. Bokov, “O grafovom rasshirenii metoda rezolyutsii dlya bulevykh formul”, Intellektualnye sistemy. Teoriya i prilozheniya, 23:3 (2019), 35–40
D. E. Gorbatenko, A. A. Semenov, “Protivodeistvie sgovoru v diskretnykh dinamicheskikh modelyakh kompyuternykh setei”, UBS, 75 (2018), 76–102
V. N. Zakharov, V. A. Kozmidiadi, “On relationships between complexity classes of Turing machines”, Comput. Math. Math. Phys., 57:4 (2017), 726–738
A. V. Sozykin, “Obzor metodov obucheniya glubokikh neironnykh setei”, Vestn. YuUrGU. Ser. Vych. matem. inform., 6:3 (2017), 28–59
S. I. Nikolenko, D. S. Tugaryov, “A complete one-way function based on a free finite rank $\mathbb Z\times\mathbb Z$ -module”, J. Math. Sci. (N. Y.), 192:3 (2013), 307–315
A. D. Korshunov, “Some unsolved problems in discrete mathematics and mathematical cybernetics”, Russian Math. Surveys, 64:5 (2009), 787–803
A. A. Kozhevnikov, S. I. Nikolenko, “On complete one-way functions”, Problems Inform. Transmission, 45:2 (2009), 168–183
J. Math. Sci. (N. Y.), 158:5 (2009), 727–740
E. A. Hirsch, D. Yu. Grigor'ev, K. V. Pervyshev, “Time hierarchies for cryptographic function inversion with advice”, J. Math. Sci. (N. Y.), 158:5 (2009), 633–644
L. A. Levin, “One-Way Functions”, Problems Inform. Transmission, 39:1 (2003), 92–103
P. Vitani, M. Li, “Kolmogorovskaya slozhnost: dvadtsat let spustya”, UMN, 43:6(264) (1988), 129–166
A. O. Slisenko, “Complexity problems in computational theory”, Russian Math. Surveys, 36:6 (1981), 23–125