41 citations to 10.1137/S0097539701389944 (Crossref Cited-By Service)
  1. Ján Pich, “Nisan-Wigderson generators in proof systems with forms of interpolation”, Mathematical Logic Quarterly, 57, no. 4, 2011, 379  crossref
  2. Alexander Razborov, “A New Kind of Tradeoffs in Propositional Proof Complexity”, J. ACM, 63, no. 2, 2016, 1  crossref
  3. James Cook, Omid Etesami, Rachel Miller, Luca Trevisan, 5444, Theory of Cryptography, 2009, 521  crossref
  4. Hanlin Ren, Rahul Santhanam, Zhikun Wang, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022, 640  crossref
  5. A. Borodin, T. Pitassi, A. Razborov, “Special Issue In Memory of Misha Alekhnovich. Foreword”, comput. complex., 20, no. 4, 2011, 579  crossref
  6. Albert Atserias, Víctor Dalmau, “A combinatorial characterization of resolution width”, Journal of Computer and System Sciences, 74, no. 3, 2008, 323  crossref
  7. Jan Krajíček, Proof Complexity, 2019  crossref
  8. Subhash Khot, Madhur Tulsiani, Pratik Worah, 8572, Automata, Languages, and Programming, 2014, 689  crossref
  9. Michael Alekhnovich, Alexander Razborov, “Satisfiability, Branch-Width and Tseitin tautologies”, comput. complex., 20, no. 4, 2011, 649  crossref
  10. Benny Applebaum, Andrej Bogdanov, Alon Rosen, “A Dichotomy for Local Small-Bias Generators”, J Cryptol, 29, no. 3, 2016, 577  crossref
1
2
3
4
5
Next