219 citations to https://www.mathnet.ru/rus/mzm4883
  1. Mikael Goldmann, Johan Håstad, “A simple lower bound for monotone clique using a communication game”, Information Processing Letters, 41:4 (1992), 221  crossref
  2. Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack, Lecture Notes in Computer Science, 577, STACS 92, 1992, 279  crossref
  3. И. Е. Шпарлинский, “О некоторых вопросах теории конечных полей”, УМН, 46:1(277) (1991), 165–200  mathnet  mathscinet  zmath  adsnasa; I. E. Shparlinski, “On some problems in the theory of finite fields”, Russian Math. Surveys, 46:1 (1991), 199–240  crossref
  4. R. Beigel, N. Reingold, D. Spielman, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference, 1991, 286  crossref
  5. R. Beigel, J. Tarui, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, 1991, 783  crossref
  6. Jeff Kahn, Roy Meshulam, “On modp transversals”, Combinatorica, 11:1 (1991), 17  crossref
  7. Eddy Mayoraz, Lecture Notes in Computer Science, 540, Artificial Neural Networks, 1991, 78  crossref
  8. Jun Tarui, Lecture Notes in Computer Science, 480, STACS 91, 1991, 238  crossref
  9. David A. Mix Barrington, James Corbett, “A note on some languages in uniform ACC0”, Theoretical Computer Science, 78:2 (1991), 357  crossref
  10. R. Smolensky, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, 1990, 628  crossref
Предыдущая
1
18
19
20
21
22
Следующая