100 citations to https://www.mathnet.ru/rus/tvp1437
  1. Steve Pincus, Rudolf E. Kalman, “Not all (possibly) “random” sequences are created equal”, Proc. Natl. Acad. Sci. U.S.A., 94:8 (1997), 3513  crossref
  2. Jack H. Lutz, Complexity Theory Retrospective II, 1997, 225  crossref
  3. В. В. Вьюгин, “Эргодическая теорема для индивидуальной случайной последовательности”, УМН, 51:6(312) (1996), 191–192  mathnet  crossref  mathscinet  zmath  adsnasa; V. V. V'yugin, “An ergodic theorem for an individual random sequence”, Russian Math. Surveys, 51:6 (1996), 1231–1232  crossref  isi
  4. Phil Diamond, Anthony Klemm, Peter Kloeden, Aleksej Pokrovskii, “Basin of attraction of cycles of discretizations of dynamical systems with SRB invariant measures”, J Stat Phys, 84:3-4 (1996), 713  crossref
  5. Leonid A. Levin, “Fundamentals of computing (a cheatlist)”, SIGACT News, 27:3 (1996), 89  crossref
  6. P. Diamond, M. Suzuki, P. Kloeden, P. Pokrovskii, “Statistical properties of discretizations of a class of chaotic dynamical systems”, Computers & Mathematics with Applications, 31:11 (1996), 83  crossref
  7. Jack H. Lutz, Elvira Mayordomo, “Measure, Stochasticity, and the Density of Hard Languages”, SIAM J. Comput., 23:4 (1994), 762  crossref
  8. David W. Juedes, James I. Lathrop, Jack H. Lutz, “Computational depth and reducibility”, Theoretical Computer Science, 132:1-2 (1994), 37  crossref
  9. Ronald V. Book, Jack H. Lutz, David M. Martin, Lecture Notes in Computer Science, 775, STACS 94, 1994, 401  crossref
  10. David W. Juedes, James I. Lathrop, Jack H. Lutz, Lecture Notes in Computer Science, 700, Automata, Languages and Programming, 1993, 277  crossref
Предыдущая
1
2
3
4
5
6
7
8
9
10
Следующая