251 citations to 10.1006/jcss.1997.1494 (Crossref Cited-By Service)
  1. Dmitry Gavinsky, Or Meir, Omri Weinstein, Avi Wigderson, Proceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014, 213  crossref
  2. Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener, “On converting CNF to DNF”, Theoretical Computer Science, 347, no. 1-2, 2005, 325  crossref
  3. Olaf Beyersdorff, “On the correspondence between arithmetic theories and propositional proof systems – a survey”, Mathematical Logic Qtrly, 55, no. 2, 2009, 116  crossref
  4. Meena Mahajan, Jayalal M. N. Sarma, “On the Complexity of Matrix Rank and Rigidity”, Theory Comput Syst, 46, no. 1, 2010, 9  crossref
  5. Jiatu Li, Igor C. Oliveira, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, 1051  crossref
  6. Shuichi Hirahara, “Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\)”, SIAM J. Comput., 52, no. 6, 2023, FOCS18-349  crossref
  7. Lijie Chen, Ce Jin, Rahul Santhanam, R. Ryan Williams, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022, 646  crossref
  8. Quantum Computing since Democritus, 2013, 243  crossref
  9. Ryan C. Harkins, John M. Hitchcock, “Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds”, ACM Trans. Comput. Theory, 5, no. 4, 2013, 1  crossref
  10. Emanuele Viola, “Guest Column”, SIGACT News, 40, no. 1, 2009, 27  crossref
Previous
1
12
13
14
15
16
17
18
26
Next