251 citations to 10.1006/jcss.1997.1494 (Crossref Cited-By Service)
  1. K.W. Regan, D. Sivakumar, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247), 1998, 186  crossref
  2. Guy Moshkovitz, 2012 IEEE 27th Conference on Computational Complexity, 2012, 159  crossref
  3. S. Aaronson, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings., 2003, 171  crossref
  4. Benny Applebaum, Pavel Raykov, 9985, Theory of Cryptography, 2016, 27  crossref
  5. Ryan Williams, Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, 2013, 21  crossref
  6. E. Allender, L. Hellerstein, P. McCabe, T. Pitassi, M. Saks, 21st Annual IEEE Conference on Computational Complexity (CCC'06), 2006, 237  crossref
  7. Antonina Kolokolova, 5028, Logic and Theory of Algorithms, 2008, 316  crossref
  8. Magnus Gausdal Find, 8476, Computer Science - Theory and Applications, 2014, 167  crossref
  9. Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss, “A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem”, SIAM J. Comput., 30, no. 2, 2000, 576  crossref
  10. Eric Allender, Michal Koucký, “Amplifying lower bounds by means of self-reducibility”, J. ACM, 57, no. 3, 2010, 1  crossref
Previous
1
11
12
13
14
15
16
17
26
Next