75 citations to 10.1007/BF02122698 (Crossref Cited-By Service)
  1. Eyal Kushilevitz, 44, 1997, 331  crossref
  2. Charles J. Colbourn, Gerzson Kéri, 5557, Coding and Cryptology, 2009, 22  crossref
  3. Lauri Hella, Kerkko Luosto, “Game characterizations for the number of quantifiers”, Math. Struct. Comp. Sci., 2024, 1  crossref
  4. M. Karchmer, R. Raz, A. Wigderson, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference, 1991, 299  crossref
  5. Bruno Codenotti, “Matrix rigidity”, Linear Algebra and its Applications, 304, no. 1-3, 2000, 181  crossref
  6. P. Hrubeš, S. Jukna, A. Kulikov, P. Pudlák, “On convex complexity measures”, Theoretical Computer Science, 411, no. 16-18, 2010, 1842  crossref
  7. P. Pudlák, V. Rödl, “A combinatorial approach to complexity”, Combinatorica, 12, no. 2, 1992, 221  crossref
  8. Anders Björner, First European Congress of Mathematics, 1994, 321  crossref
  9. NAVIN GOYAL, LUIS RADEMACHER, SANTOSH VEMPALA, “Query Complexity of Sampling and Small Geometric Partitions”, Combinator. Probab. Comp., 24, no. 5, 2015, 733  crossref
  10. Troy Lee, 4393, STACS 2007, 2007, 145  crossref
Previous
1
2
3
4
5
6
7
8
Next