8 citations to 10.1007/s00493-002-0007-7 (Crossref Cited-By Service)

1. Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander Razborov, 6755, Automata, Languages and Programming, 2011, 630  
2. Kazuhisa SETO, “An Introduction to Lower Bounds on Resolution Proof Systems”, IIS, 21, № 4, 2015, 307  
3. Siu Man Chan, Aaron Potechin, Proceedings of the forty-fourth annual ACM symposium on Theory of computing, 2012, 495  
4. Albert Atserias, Ilario Bonacina, Susanna F. De Rezende, Massimo Lauria, Jakob Nordström, Alexander Razborov, “Clique Is Hard on Average for Regular Resolution”, J. ACM, 68, № 4, 2021, 1  
5. Jun Tarui, 4484, Theory and Applications of Models of Computation, 2007, 128  
6. Alexander A Razborov, “Resolution lower bounds for perfect matching principles”, Journal of Computer and System Sciences, 69, № 1, 2004, 3  
7. Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov, “Parameterized Bounded-Depth Frege Is not Optimal”, ACM Trans. Comput. Theory, 4, № 3, 2012, 1  
8. Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander Razborov, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018, 866