246 citations to 10.1006/jcss.1997.1494 (Crossref Cited-By Service)
  1. Scott Aaronson, Avi Wigderson, “Algebrization”, ACM Trans. Comput. Theory, 1, no. 1, 2009, 1  crossref
  2. Oded Goldreich, 1853, Automata, Languages and Programming, 2000, 687  crossref
  3. Kazuyuki Amano, Akira Maruoka, 3341, Algorithms and Computation, 2004, 28  crossref
  4. Alexandre de Castro, “One-way-ness in the input-saving (Turing) machine”, Physica A: Statistical Mechanics and its Applications, 415, 2014, 473  crossref
  5. Jan Bydžovský, Moritz Müller, “Polynomial time ultrapowers and the consistency of circuit lower bounds”, Arch. Math. Logic, 59, no. 1-2, 2020, 127  crossref
  6. Eric Allender, 5010, Computer Science – Theory and Applications, 2008, 3  crossref
  7. Thomas Seiller, “Interaction Graphs”, ACM Trans. Comput. Logic, 19, no. 3, 2018, 1  crossref
  8. Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas, “Reconstruction of Full Rank Algebraic Branching Programs”, ACM Trans. Comput. Theory, 11, no. 1, 2019, 1  crossref
  9. Lijie Chen, Hanlin Ren, “Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization”, SIAM J. Comput., 51, no. 3, 2022, STOC20-115  crossref
  10. Eric Allender, Bireswar Das, “Zero knowledge and circuit minimization”, Information and Computation, 256, 2017, 2  crossref
Previous
1
6
7
8
9
10
11
12
25
Next