47 citations to https://www.mathnet.ru/rus/mzm5393
  1. Christoph Meinel, Lecture Notes in Computer Science, 452, Mathematical Foundations of Computer Science 1990, 1990, 61  crossref
  2. J. Hastad, M. Goldmann, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, 1990, 610  crossref
  3. Ravi B. BOPPANA, Michael SIPSER, Algorithms and Complexity, 1990, 757  crossref
  4. Elias Dahlhaus, Marek Karpinski, Lecture Notes in Computer Science, 318, SWAT 88, 1988, 139  crossref
  5. Matthias Krause, Christoph Meinel, Stephan Waack, Lecture Notes in Computer Science, 324, Mathematical Foundations of Computer Science 1988, 1988, 405  crossref
  6. А. А. Разборов, “Нижние оценки размера схем ограниченной глубины в базисе $\{\&,\vee,\oplus\}$”, УМН, 41:4(250) (1986), 219–220  mathnet  mathscinet  zmath  adsnasa; A. A. Razborov, “Lower estimates of the dimension of schemes of bounded depth in the basis $\{\&,\vee,\oplus\}$”, Russian Math. Surveys, 41:4 (1986), 181–182  crossref  isi
  7. David S Johnson, “The NP-completeness column: An ongoing guide”, Journal of Algorithms, 7:2 (1986), 289  crossref
Предыдущая
1
2
3
4
5