100 citations to https://www.mathnet.ru/rus/tvp1437
  1. Л. А. Левин, “Односторонние функции”, Пробл. передачи информ., 39:1 (2003), 103–117  mathnet  mathscinet  zmath; L. A. Levin, “One-Way Functions”, Problems Inform. Transmission, 39:1 (2003), 92–103  crossref
  2. В. В. Вьюгин, В. П. Маслов, “Об экстремальных соотношениях между аддитивными функциями потерь и колмогоровской сложностью”, Пробл. передачи информ., 39:4 (2003), 71–87  mathnet  mathscinet  zmath; V. V. V'yugin, V. P. Maslov, “On Extremal Relations between Additive Loss Functions and the Kolmogorov Complexity”, Problems Inform. Transmission, 39:4 (2003), 380–394  crossref
  3. Shu-Ju Tu, Ephraim Fischbach, “Geometric random inner products: A family of tests for random number generators”, Phys. Rev. E, 67:1 (2003)  crossref
  4. Itai Benjamini, Olle Häggström, Yuval Peres, Jeffrey E. Steif, “Which properties of a random sequence are dynamically sensitive?”, Ann. Probab., 31:1 (2003)  crossref
  5. Wolfgang Merkle, “The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences”, J. symb. log., 68:4 (2003), 1362  crossref
  6. A. Benczúr, “The evolution of human communication and the information revolution — A mathematical perspective”, Mathematical and Computer Modelling, 38:7-9 (2003), 691  crossref
  7. Cristian S. Calude, Texts in Theoretical Computer Science An EATCS Series, Information and Randomness, 2002, 33  crossref
  8. Cristian S. Calude, Texts in Theoretical Computer Science An EATCS Series, Information and Randomness, 2002, 95  crossref
  9. Sérgio B. Volchan, “What Is a Random Sequence?”, The American Mathematical Monthly, 109:1 (2002), 46  crossref
  10. Paul Vitányi, Lecture Notes in Computer Science, 2518, Algorithms and Computation, 2002, 588  crossref
Предыдущая
1
2
3
4
5
6
7
8
9
10
Следующая