75 citations to 10.1007/BF02122698 (Crossref Cited-By Service)
  1. M. Karchmer, A. Wigderson, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993, 102  crossref
  2. Or Meir, “On Derandomized Composition of Boolean Functions”, comput. complex., 28, № 4, 2019, 661  crossref
  3. Mika Goos, Rahul Jain, Thomas Watson, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), 2016, 565  crossref
  4. Anders Björner, First European Congress of Mathematics Paris, July 6–10, 1992, 1994, 321  crossref
  5. Toniann Pitassi, Robert Robere, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018, 1207  crossref
  6. A. Beimel, E. Weinreb, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., 2003, 428  crossref
  7. Lance Fortnow, 880, Foundation of Software Technology and Theoretical Computer Science, 1994, 256  crossref
  8. Johan HÅ stad, “The Shrinkage Exponent of de Morgan Formulas is 2”, SIAM J. Comput., 27, № 1, 1998, 48  crossref
  9. Satyanarayana V. Lokam, 1530, Foundations of Software Technology and Theoretical Computer Science, 1998, 307  crossref
  10. Mika Göös, Rahul Jain, Thomas Watson, “Extension Complexity of Independent Set Polytopes”, SIAM J. Comput., 47, № 1, 2018, 241  crossref
1
2
3
4
5
6
7
8
Следующая